#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;


int main(){
    string A,B;
    cin>>A;
    cin>>B;

    reverse(A.begin(),A.end());
    reverse(B.begin(),B.end());

    int maxlen=max(A.size(),B.size());
    int offset=0;

    vector<int> ans;

    for(int i=0;i<maxlen;i++){
        int c=0;
        //cout<<"i="<<i<<endl;
        if(A.size()-1>=i){
            c+=A[i]-'0';
        }
        if(B.size()-1>=i){
            c+=B[i]-'0';
        }
        c+=offset;
        offset=0;
        ans.push_back(c%10);
        //cout<<"c="<<c<<endl;
        offset=c/10;
    }

    if(offset>0){
        ans.push_back(offset);
    }

    // while(ans.size()>=0 && ans.back()==0){
    //     ans.pop_back();
    // }
    reverse(ans.begin(),ans.end());

    for(int c:ans){
        cout<<c;
    }
    cout<<endl;


}