#include using namespace std; using ll = long long; using vi = vector; using vl = vector; using pi = pair; using pl = pair; #define all(x) x.begin(),x.end() #define rep(i,j,n) for (long long i = j; i < (long long)(n); i++) const long long MOD = 1000000007; const long long MOD2 = 998244353; const int INF = ((1<<30)-1); const long long LINF = (1LL<<60); const double PI = 3.141592653589793238; template inline void chmax(T& a, T b) {if (a < b) {a = b;}} template inline void chmin(T& a, T b) {if (a > b) {a = b;}} int solve(){ string s,t; cin >> s >> t; reverse(all(s)); reverse(all(t)); if(s.size() > t.size())swap(s,t); int n = t.size(); int i = 0; string ans; int now = 0; while(i < n){ int a=0,b=0; if(i < s.size())a = s[i]-'0'; b = t[i]-'0'; now += a+b; ans.push_back(char('0'+now%10)); now /= 10; ++i; } while(now != 0){ ans.push_back(char('0'+now%10)); now /= 10; } rep(i,0,ans.size())cout << ans[ans.size()-1-i]; cout << endl; return 0; } int main(){ cout << fixed << setprecision(10); ios::sync_with_stdio(0), cin.tie(0); int t = 1; //cin >> t; for(int i = 0; i < t; i++){ solve(); } return 0; }