#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; string a , b; int lena , lenb , lenc , a1[N] , b1[N] , c1[N] , x; int main() { cin >> a >> b; lena = a.size(); lenb = b.size(); for (int i = 0 ; i <= lena ; i++){ a1[i] = a[lena - i - 1] - '0'; } for (int i = 0 ; i <= lenb ; i++){ b1[i] = b[lenb - i - 1] - '0'; } lenc = max(lena , lenb); for (int i = 0 ; i <= lenc ; i++){ c1[i] = a1[i] + b1[i] + x; x = c1[i] / 10; c1[i] %= 10; } c1[lenc] = x; while (c1[lenc] == 0 && lenc > 0){ lenc--; } for (int i = lenc ; i >= 0 ; i--){ cout << c1[i]; }

return 0;

}