#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#define maxSize 1000
using namespace std;
int main()
{
string s;
int a[101] = { 0 }, b[101] = { 0 }, c[102] = { 0 };
int maxLen, alen, blen, i, j = 0;
cin >> s;
reverse(s.begin(), s.end());
alen = s.size();
for (i = 0; i<alen; i++)
a[i] = s[i] - 48;
cin >> s;
reverse(s.begin(), s.end());
blen = s.size();
for (i = 0; i < blen; i++)
b[i] = s[i] - 48;
maxLen = alen > blen ? alen : blen;
for (i = 0; i < maxLen; i++) {
c[i] = (a[i] + b[i] + j) % 10;
j = (a[i] + b[i] + j) / 10;
}
if (j)
printf("%d", j);
for (i = maxLen - 1; i >= 0; i--)
printf("%d", c[i]);
cout << endl;
return 0;
}