#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
using LL=long long;
using std::cout;using std::endl;using std::cin;
using std::vector;using std::string;using std::set;using std::multiset;
using std::pair;using std::map;
using std::min;using std::max;
using std::make_pair;using std::swap;
namespace ndifix{
template<class T> void sort(T &v){std::sort(v.begin(),v.end());}
template<class T> void rsort(T &v){std::sort(v.rbegin(),v.rend());}

}


int main(){
  int a,b;cin>>a>>b;
  cout<<a-(-1)*b<<endl;
  return 0;
}