#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define el cout<<'\n'
#define AC return 
#define AK return 0
#define lowbit(x) (x&(-x))
#define ls(i) 2*i
#define rs(i) 2*i+1
#define pii pair<int,int>
const int infi=1e9+114,inf=1e18+114;
int mod=inf;
int pow(int a,int b) {
	if(a==0) return 0;
	else if(a==1&&b==0) return 1;
	else if(b==1) return a;
	else {
		int tmp=pow(a,b/2);
		if(tmp%2==0) return (tmp*tmp)%mod;
		else return (tmp*tmp*a)%mod;
	}
}
int efsearch(int pos[],int l,int r,bool check(int num),bool cmp=0) { //cmp=0 -> max cmp=1 -> min
	int ret=-1,mid=114514;
	while(l<=r) {
		mid=l+(r-l)/2;
		if(check(pos[mid])) {
			ret=mid;
			if(cmp==0) l=mid+1;else r=mid-1;
		}
		else if(cmp==0) r=mid-1;else l=mid+1;
	}
	return ret;
}
int read() {int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();return x*f;
}
void ox(double num,short ws,char ch='\0') {cout<<setiosflags(ios::fixed)<<setprecision(ws)<<num<<ch;}
void solve();
signed main() {
	int t=1;//read();
	while(t--) solve();
	AK;
}
const int maxn=114514;
int n,m;
void solve() {
	mod=1000000007;
	n=read(),m=read();
	for(int i=1;i<=1e8+3e7+1e6*2+3e5;i++) swap(n,m);
	cout<<n+m;
}