#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0;i<(long long)n;i++)
#define reps(i,n) for(long long i=1;i<=(long long)n;i++)
#define loop(i,l,r) for(long long i=l;i<=(long long)r;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yn(x) cout << (x? "Yes":"No") << endl
#define cou(x) cout << x << endl
//#pragma GCC target ("avx,avx2")四則演算
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")ループ
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")浮動小数点
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using bint=mp::cpp_int;
// #include <boost/multiprecision/cpp_dec_float.hpp>　やばい少数派(重い)
// #include <boost/math/constants/constants.hpp>円周率他
// #include <boost/dynamic_bitset.hpp> dynamicbitset
const long long mod=998244353LL;
const long long mods=1000000007LL;
const long long yab=2500000000000000000LL;
const int kaz=1000000000;
const long long aho =-yab;
const long double eps=1.0e-14L;
const long double pi=acosl(-1.0L);
using ll=long long;
using st=string;
using P=pair<ll,ll>;
using tup=tuple<ll,ll,ll>;
using vi=vector<ll>;
using vc=vector<char>;
using vb=vector<bool>;
using vs=vector<string>;
using vp=vector<P>;
using sp=set<P>;
using si=set<ll>;
using vvi=vector<vector<ll>>;
using vvc=vector<vc>;
using vvb=vector<vb>;
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};
const vector<int> ex = {-1, -1, -1, 0, 0, 1, 1, 1};
const vector<int> ey = {-1, 0, 1, -1, 1, -1, 0, 1};
int mysearch(vi &a,ll x){
	int l=-1;
	int r=a.size()-1;
	while(r-l>1){
		int mid=(l+r)/2;
		if(x==a[mid])return mid;
		else if(x<a[mid])r=mid;
		else l=mid;
	}
	if(x==a[r])return r;
	return -1;
}
template<typename T1,typename T2>
void co(bool x,T1 y,T2 z){
  if(x)cout << y << endl;
  else cout << z << endl;
}
template<typename T>
bool chmax(T &a, T b){
	if(a<b){
		a=b;
		return true;
	}
	return false;
}
template<typename T>
bool chmin(T &a, T b){
	if(a>b){
		a=b;
		return true;
	}
	return false;
}
template<typename T>
void print(vector<T> &a){
	for(int i=0;i<a.size();i++){
		cout << a[i];
		if(i==(long long)a.size()-1)cout << endl;
		else cout << " ";
	}
}
ll mypow(ll x,ll y){
	ll ret=1;
	while(y>0){
		if(y&1)ret=ret*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return ret;
}
int main(){
	bint a,b;
	cin >> a >> b;
	cout << a+b << endl;
}