#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7;  // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 2E+05;
struct edge {
    int to, cost, id;
};

ll di[4] = {0, -1, 0, 1}, dj[4] = {1, 0, -1, 0};

string A, B;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> A >> B;

    string ans;
    reverse(ALL(A));
    reverse(ALL(B));
    A += string(max<int>((int)B.size() - A.size(), 0), '0');
    B += string(max<int>((int)A.size() - B.size(), 0), '0');

    int k = 0;
    for (int i = 0; i < A.size(); ++i) {
        int xa = A[i] - '0';
        int xb = B[i] - '0';
        int s = xa + xb + k;
        if (s >= 10) {
            k = 1;
            s -= 10;
        } else {
            k = 0;
        }
        ans += (char)(s + '0');
    }
    if (k > 0)
        ans += (char)(k + '0');

    reverse(ALL(ans));

    // for (int i = 0; i < N; i++) {
    //     for (int j = 0; j < N; j++) {
    //         cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] <<
    //         "\n";
    //     }
    // }

    cout << ans << "\n";

    return 0;
}