//1.先将两个数存入字符串 
//2.倒序存入两个数组
//3.从右向左累加
//4.从右向左依次进位
//5.倒序输出
#include<iostream>
using namespace std;
string s1,s2;
int a[10010];
int b[10010];
int ans[10010];
int main(){
	cin >> s1 >> s2;
	int len1 = s1.size();
	int len2 = s2.size();
	for (int i = 0;i <= len1 - 1;i++){
		a[len1 - i] = s1[i] - '0';
	}
	for (int i = 0;i <= len2 - 1;i++){
		b[len2 - i] = s2[i] - '0';
	}
	int len = max(len1,len2);
	for (int i = 1;i <= len;i++){
		ans[i] += a[i] + b[i];
		if (ans[i] >= 10){
			ans[i + 1] += ans[i] / 10;
			ans[i] = ans[i] % 10;
		}
	}
	if (ans[len + 1] > 0){
		len += 1;
	}
	for (int i = len;i >= 1;i--){
		cout << ans[i];
	}
	return 0;
}