#include <stdio.h>
#include<string.h>
int top;
char stack[100];
void init()
{
top=-1;
}
void push(char data)
{
top++;
stack[top]=data;
}
int pop()
{
return stack[top--];
}
int main()
{
char arr[101],arr1[101],max;
int k=0,sum=0,a,b,c,d,n,mxlen,mnlen,i;
init();
scanf("%s %s",arr,arr1);
a=strlen(arr);
b=strlen(arr1);
max = a>b?'a':'b';
mxlen = (max=='a'?a:b)-1;
mnlen = (max=='a'?b:a)-1;
//printf("%d %d \n",mxlen, mnlen);
while(mxlen>-1) //둘 중 큰 길이가 -1이 되기전까지
{
if(max=='a')
{
c = arr[mxlen]-'0';
if(mnlen==-1)
d = 0;
else
d = arr1[mnlen]-'0';
}
else
{
c = arr1[mxlen]-'0';
if(mnlen==-1)
d = 0;
else
d = arr[mnlen]-'0';
}
//printf("\n c = %d d = %d k = %d c+d+k = %d\n",c,d,k,c+d+k);
push((c+d+k)%10);
k = (c+d+k)/10;
//printf("\nk = %d\n",k);
mxlen--;
if(mnlen>-1)
{
mnlen--;
}
}
n=top;
if(k==1)
{
printf("%d",k);
}
for(i=0; i<=n; i++)
{
printf("%d",pop());
}
}