/*
things to check :
1.  int overflow or long long memory need
2.  recursion / array / binary search / dp / loop bounds
3.  precision
4.  special cases (n = 1,bounds)
5.  delete debug statements
6.  initialize(especially multi-tests)
7.  = or ==, n or m, ++ or --, i or j, > or >=, < or <=
8.  keep it simple and stupid
9.  do not delete, use // instead
10. operator priority
11. is there anything extra to output?
12. ...

something to think about :
1. greedy? dp? searching? dp with matrix/ segment tree? binary search?
2. If contains "not", why not ?????? or few affect?
3. Take care of the data ranges.
*/
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define f(i,a,b) for(register int i = a; i <= b; i ++)
#define g(i,b,a) for(register int i = b; i >= a; i --)
#define CI const int

int read() {
    char c = getchar();
    int x = 0, p = 1;
    while ((c < '0' || c > '9') && c != '-') c = getchar();
    if (c == '-') p = -1, c = getchar();
    while (c >= '0' && c <= '9')
        x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return x * p;
}

signed main() {
    int a = read(), b = read();
    int res = 0;
    while (a --) res ++;
    while (b --) res ++;
    cout << res << "\n";
    return 0;
}