#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;

bool is_num(string s) {
    for (int i = 0; i < s.size(); i++) {
        if (s[i] < '0' || s[i] > '9') {
            return false;
        }
    }
    return true;
}

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    string a, b;
    cin >> a >> b;

    if (is_num(a) && is_num(b)) {
        ll A = 0;
        for (int i = a.size() - 1; i >= 0; i--) {
            if (a[i] == '-') {
                A = -A;
            } else {
                A *= 10LL;
                A += a[i] - '0';
            }
        }

        ll B = 0;
        for (int i = b.size() - 1; i >= 0; i--) {
            if (b[i] == '-') {
                B = -B;
            } else {
                B *= 10LL;
                B += b[i] - '0';
            }
        }

        cout << a + b << endl;
    } else {
        cout << "hoge" << '\n';
    }

    return 0;
}