#include <bits/stdc++.h>
using namespace std;
long long int m,n;
int num1[505],num2[505],jinwei[505],res[505],s,u,w=0,v=0;
string s1,s2;
void plus1(){
	while (m)
	{
		//得到当前整数 尾位数
		s = m % 10;
		//切割这一整形
		m /= 10;
		num1[w]=s;
		w++;
	}
	while (n)
	{
		u = n % 10;
		n /= 10;
		num2[v]=u;
		v++;
	}
	int l1=w;
	int l2=v;
	
	int l3=max(l1,l2)+1;
	for(int i=0;i<l3;i++){
		res[i]=(num1[i]+num2[i]+jinwei[i])%10;
		jinwei[i+1]=(num1[i]+num2[i]+jinwei[i])/10;
	}
	if(res[l3-1]==0) l3--;
	for(int i=l3-1;i>=0;i--){
		cout<<res[i];
	}
}
int plus2(int a,int b){
	int ab=a+b;
	if(a==0)return b;
	else if(b==0)return a;
	else return ab;
}
int main(){
	
	cin>>m>>n;
	if(m<=4294967295&&n<=4294967295){
		cout<<plus2(m,n);
	}else{
		plus1();
	}
	return 0;
	
}