#include #define REP(i, a, n) for (long long i = (a); i < (long long)(n); ++i) #define REPC(i, a, n) for (long long i = (a); i <= (long long)(n); ++i) #define ALL(t) t.begin(), t.end() #define RALL(t) t.rbegin(), t.rend() #define MATINIT(type, row, col, init) \ vector>(row, vector(col, init)); #define Yes(cond) cout << (cond ? "Yes" : "No") << endl; #define YES(cond) cout << (cond ? "YES" : "NO") << endl; using namespace std; using LL = long long; using ULL = unsigned long long; template using VEC = std::vector; template using MAT = std::vector>; void DUMP() { cerr << endl; } template void DUMP(Head &&head, Tail &&... tail) { cerr << head << ", "; DUMP(std::move(tail)...); } template ostream &operator<<(ostream &os, vector &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, set &s) { os << "{"; for (auto p : s) os << p << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, map &m) { os << "{"; for (auto p : m) os << p << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, pair p) { os << "[" << p.first << " " << p.second << "]"; return os; } int main() { int N, K; cin >> N >> K; cout << (N - K >= 0 ? (LL)pow(2, N - K) : 0) << endl; return 0; }