#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

ifstream fin("adunare.in");
ofstream fout("adunare.out");

/*int di[4] = {0, 0, 1, -1};
int dj[4] = {1, -1, 0, 0};

int Map[180][180], N, M;
int startx, starty, stopx, stopy;

queue < pair < int, int > > coada;
*/
int A, B;
void Read()
{
    fin>>A>>B;
    /*for(int i=1; i<=M; i++)
    {
        int x, y;
        fin>>x>>y;
        Map[x][y]=-1;
    }
    fin>>startx>>starty;
    fin>>stopx>>stopy;
	*/
}
/*
bool Ok(int i, int j)
{
    if(i<1 || j<1 || i>N || j>N)
        return false;
    if(Map[i][j]==-1)
        return false;
    return true;
}

void Lee()
{
    int i, j, i_urmator, j_urmator;
    Map[startx][starty]=1;
    coada.push(make_pair(startx,starty));
    while(!coada.empty())
    {
        i=coada.front().first;
        j=coada.front().second;
        coada.pop();
        for(int directie = 0; directie < 4; directie++)
        {
            i_urmator = i + di[directie];
            j_urmator = j + dj[directie];
            if(Ok(i_urmator, j_urmator) && Map[i_urmator][j_urmator]<1)
            {
                Map[i_urmator][j_urmator] = Map[i][j]+1;
                coada.push(make_pair(i_urmator, j_urmator));
            }
        }
    }
}
*/
int main()
{
    Read();
    /*Lee();*/
    fout<<A+B;
    return 0;
}