1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <stdio.h>
#include <time.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <map> 
#include <string>
#include <vector>  
#include <iostream> 
#include <sstream> 
#include <queue>
#include <algorithm>
#include <assert.h>


using namespace std;

#define ll long long
#define PB 		push_back
#define FOR(a,start,end) 	for(int a=int(start); a<int(end); a++)
#define INF 		INT_MAX
#define SORT(a) 	sort(a.begin(),a.end()) 
#define CL(a,x) 		memset(a,x,sizeof(a))
#define REP(a,x)	for(int a=0;a<x;a++)
#define REP1(a,x)	for(int a=1;a<=x;a++)
#define MP 		make_pair



typedef vector<ll>     vi;
typedef pair<ll, ll>     pii;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vector<ll> > vvi;
typedef vector<vector<string> > vvs;
typedef vector<pair<string, string> > vss;
typedef pair<string, string> pss;
typedef pair<ll, pii> ppii;
typedef vector<ppii> vppii;
typedef vector<vector<pii> > vvii;
typedef vector<vvi> vvvi;


int b1, n, k, a, b, k1,k2;

string wa, wb,wc;


int main() {
	//freopen("c:\\wojtek\\uva\\pa\\debug\\t1.in.txt", "rt", stdin);

//	while (1) {
	
	cin >> wa;
	cin >> wb;

	k1 = (int)wa.size();
	k2 = (int)wb.size();
	if (k1 < k2) {
		wc.assign(k2 - k1, '0');
		wa = wc + wa;
	}
	else if (k2 < k1) {
		wc.assign(k1 - k2, '0');
		wb = wc + wb;
	}
	k = 0;
	for(int i=wa.size()-1;i>=0;i--){
		a = wa[i] - '0' + wb[i] - '0' + k;
		wb[i] = a % 10 + '0';
		k = a / 10;
	}
	if (k > 0) {
		wc.assign(1, '1');
		wb = wc + wb;
	}
	cout << wb << endl;
	// }

	return 0;

}