#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define M 100000
char al[M],bl[M];
int  a[M],b[M],c[M];
int longa,longb;
void yawei()
{
    int i,j,k=1;
    for( i=longa-1,j=1;i>=0;i--)    
      {
         if (k==10000) j++,k=1;
         a[j]+=k*(al[i]-‘0‘);
         k*=10;         
      }
    longa=j;
    i,j,k=1;
    for( i=longb-1,j=1;i>=0;i--)    
      {
         if (k==10000) j++,k=1;
         b[j]+=k*(bl[i]-‘0‘);
         k*=10;         
      }
    longb=j;
   
}
int main()
{
    //gets(al);gets(bl);
    scanf("%s%s",al,bl);
    longa=strlen(al);longb=strlen(bl);
    int longl;
    yawei();
    longl=max(longa,longb);
    int i=1,cc=0;
    for(;i<=longl;i++)
    {
        c[i]=(a[i]+b[i]+cc)%10000;前一位进位会对本位进位产生影响，所以应该先加后除。
        cc=(a[i]+b[i]+cc)/10000;
    }
    if(cc)    c[++longl]=cc;
    
    printf("%d",c[longl]); 
    for(int i=longl-1;i>=1;i--)
    printf("%04d",c[i]);
    return 0;
}