#include <bits/stdc++.h>
using namespace std;
const long long BASE = 1e9 + 7;
const float EPS = 1e-6;
const long long EPS_INT = 1e12;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
inline long long fpow(long long a, long long n, long long p = BASE) {
  long long r = 1;
  for (; n; n >>= 1) {
    if (n & 1) r = r * a % p;
    a = a * a % p;
  }
  return r;
}
inline long long addmod(long long a, long long b, long long p = BASE) {
  a = (a + b);
  if (a > p) a -= p;
  return a;
}
inline long long submod(long long a, long long b, long long p = BASE) {
  a = (a - b);
  if (a < 0) a += p;
  return a;
}
inline long long multi(long long a, long long b, long long p = BASE) {
  return a * b % p;
}
inline long long inverse(long long a, long long p = BASE) {
  return fpow(a, p - 2, p);
}
inline long long maximize(long long& a, long long b) {
  if (a < b) a = b;
  return a;
}
inline long long minimize(long long& a, long long b) {
  if (a > b) a = b;
  return a;
}
const int MAX = (long long)1e6;
string arrA[MAX + 1];
long long mark[500];
void solves();
int main() {
  if (fopen("input.inp", "r")) {
    freopen("input.inp", "r", stdin);
  } else {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  }
  solves();
  return 0;
}
void solves() {
  long long n;
  cin >> n;
  if (n & 1) {
    cout << 0;
  } else {
    cout << (1 << (n / 2));
  }
}
