#include <iostream>
#include <cstring>
using namespace std;
int A[2000]; 
int B[2000];
int sum[99999];
int main()
{
	int n,i,k;
	string s1,s2;
	cin >> s1 >> s2;
	A[0] = s1.size();
	B[0] = s2.size(); 
	for(i = 1;i <= s1.size();i++)
	{
		A[i] = s1[A[0] - i] - '0';
	}
	for(i = 1;i <= s2.size();i++)
	{
		B[i] = s2[B[0] - i] - '0';
	}
	k = max(A[0],B[0]);
	for(i = 1;i <= k;i++)
	{
		A[i + 1] += (A[i] + B[i]) / 10;
		A[i] = (A[i] + B[i]) % 10;
	}
	if(A[k + 1] != 0)k++;
	for(i = k;i >= 1;i--)cout << A[i];
	return 0;
} 

#4#5#6#8#10WA