#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    string a, b;
    cin >> a >> b;

    ll na = (ll)a.size();
    ll nb = (ll)b.size();

    for(ll i=0; i<na/2; i++) swap(a[i], a[na-1-i]);
    for(ll i=0; i<nb/2; i++) swap(b[i], b[nb-1-i]);

    string c="";
    ll carry = 0;
    rep(i, min(na, nb)){
        ll x = (a[i]-'0') + (b[i]-'0') + carry;
        c += (x%10 + '0');
        carry = x/10;
    }

    for(ll i=min(na, nb); i<max(na, nb); i++){
        if(na > nb){
            ll x = (a[i]-'0') + carry;
            c += (x%10 + '0');
            carry = x/10;
        }else{
            ll x = (b[i]-'0') + carry;
            c += (x%10 + '0');
            carry = x/10;
        }
    }

    if(carry > 0) c += (carry + '0');

    ll nc = (ll)c.size();
    for(ll i=0; i<nc/2; i++) swap(c[i], c[nc-1-i]);
    cout << c << endl;
}