#include<algorithm>
#include<cstring>
#include<stdio.h>
#include<iostream>
#define ll long long
using namespace std;
int main(){
	char a1[505],b1[505];
	ll a[505],b[505],c[505];
   ll lena,lenb,lenc;
	scanf("%s%s",a1,b1);
	lena=strlen(a1);lenb=strlen(b1);
	for(ll i=0;i<=lena-1;i++)
      a[lena-i]=a1[i]-48;
	for(ll i=0;i<=lenb-1;i++)
      b[lenb-i]=b1[i]-48;
    if(a[0]=='0'&&b[0]=='0'){
        printf("0\n");
        return 0;
    }
	ll last=0;
	lenc=1;
	while(lenc<=lena||lenc<=lenb){
	   c[lenc]=a[lenc]+b[lenc]+last;
		last=c[lenc]/10;
		c[lenc]%=10;
		lenc++;
	}
	c[lenc]=last;
	while(c[lenc]==0)lenc--;
	for(ll i=lenc;i>=1;i--) 
      printf("%lld",c[i]);
	printf("\n");
	return 0;
}