/*


*/

#include<iostream>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<map>
#include<set>
#include<climits>
#include<numeric>
#include<queue>
#include<unordered_map>
#include<string>
#include<climits>
#include<unordered_set>
#include<bitset>
#include<cstring>
#include<cmath>
#include<stack>
#include<tuple>
#if 1
#define pb push_back
#define endl '\n'
#define fi first
#define se second
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define CDIV(a,b) (((a)+(b)-(1))/(b))
using namespace std;
using ll = long long;
using ld = long double;
const ll inf = 1e17 + 5;
const int mod = 1e9 + 7;
const int N = 1e6;
#endif

void fileio(string s = "test"){
    #ifndef ONLINE_JUDGE
        freopen((s+string(".in")).c_str(),"r",stdin);
        freopen((s+string(".out")).c_str(),"w",stdout);
    #endif
}

int mod_(int a, int b)
{
    if(a >= 0)return a % b;
    a += (-a/b + 1) * b;
    return a % b;
}

ll bpow(ll a, ll p)
{
    if(a == 0 or a == 1)return a;
    ll ans = 1;
    while(p)
    {
        if(p&1)ans = ans * a % mod;
        a = a * a % mod;
        p >>= 1;
    }
    return ans;
}

/*
1. CHECK IF THE ANSWER IS MODULO M DAMMIT
2. Edge cases
3. Check for overflow (maybe before edge cases idk)
4. Bpow w/ or w/o mod?

24. Use the number 24 (it automatically makes everything turn to ac)
25. INITIALIZE VARIABLES
*/


void solve()
{
    int a, b;
    cin >> a >> b;
    cout << a + b << endl;
}

signed main()
{
    //fileio();
    freopen("assembly.in", "r", stdin);
    freopen("gathering.out", "w", stdout);
    fio; 
    //int t;cin >> t;while(t-->0)
        solve();
}


/*

*/