#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 5;
long long k[62] = {1};
int a[MAXN];
int main() {
  for (int i = 1; i <= 60; i++) {
    k[i] = 2 * k[i - 1];
  }
  int n;
  cin >> n;
  if (n & 1)
    cout << 0 << endl;
  else {
    n /= 2;
    cout << k[n] << endl;
  }
  return 0;
}
