#include <algorithm>
#include <cstdio>
#include <cstring>
#include <stack>

#define MAXDIGIT 5000
#define BAZA ((long long)(1ULL << 32))

struct nrMare {
  unsigned int dig[MAXDIGIT / 8];
  int nrD;
  void print(FILE *fout) { // printeaza nr in fout
    // nrMare aux;
    // aux.copy(*this);      // auxiliar ca sa nu fie distructiva functia si pur
    // si
    //  simplu sa printeze
    std::stack<char> rez; // stiva temporara sa tin digitele in minte
    if (nrD == 0)
      fprintf(fout, "0");
    while (nrD)
      rez.push('0' + divide(10));
    while (!rez.empty()) {
      fputc(rez.top(), fout);
      rez.pop();
    }
    // this->copy(aux);
  }
  void multiplyInt(int b) {
    int i;
    unsigned long long t = i = 0;
    while (i < nrD || t > 0) {
      t += (unsigned long long)b * (unsigned long long)dig[i];
      dig[i] = (unsigned int)t;
      t = t >> 32;
      ++i;
    }
    nrD = std::max(i, nrD);
  }
  /*void multiplyHuge( const nrMare& b){
    int i,j;
    unsigned long long t = i = 0;
    while(i < b.nrD || t > 0) {
      t = j = 0;
      while(i < nrD || t > 0){
        t += (unsigned long long)b.dig[i] + (unsigned long long)dig[i];
        dig[i] = (unsigned int)t;
        t = t >> 32;
        ++i;
      }
    }
  }*/
  int divide(int a) {
    unsigned long long t = 0;
    for (int i = nrD - 1; i >= 0; i--) {
      t = t * BAZA + dig[i];
      dig[i] = t / a;
      t %= a;
    }
    while (nrD > 0 && dig[nrD - 1] == 0)
      nrD--;
    return t; // returneaza modulul
  }
  void add(const nrMare &a) {
    int i;
    unsigned long long t = i = 0;
    while (i < nrD || i < a.nrD || t > 0) {
      t += (unsigned long long)a.dig[i] + (unsigned long long)dig[i];
      dig[i] = (unsigned int)t;
      t = t >> 32;
      ++i;
    }
    nrD = std::max(i, nrD);
    nrD = std::max(a.nrD, nrD);
  }
  inline void clear() {
    memset(dig, 0, sizeof(dig[0]) * (MAXDIGIT / 8));
    nrD = 0;
  }
  void set(int a) {
    clear();
    dig[0] = a;
    nrD = 1;
  }
  // baga a in nr mare curent (operatorul = )
  void copy(const nrMare &a) {
    clear();
    for (int i = 0; i < a.nrD; i++)
      dig[i] = a.dig[i];
    nrD = a.nrD;
  }
}; // stiu ca structul e cam bloated dar poate imi va trebui in alta problema si
   // doar dau copy paste
nrMare a;

void fact(int a,
          nrMare &rez) { // calculeaza factorial de a si il pune in rez, nu-i
                         // nevoie de memoizare ptc calculam doar o data
  rez.set(1);
  for (int i = 2; i <= a; i++)
    rez.multiplyInt(i);
}
void calcSemne(int n, nrMare &a) { // calculeaza posibilitatile semnelor, care
                                   // sunt 2^(n^2) == (2^n) ^ 2
  for (int i = 1; i <= n * n; i++) // ineficient, probabil o sa schimb
    a.multiplyInt(2);
}
int main() {

  FILE *fin, *fout;
  fin = fopen("patrate2.in", "r");
  fout = fopen("patrate2.out", "w");
  int n;
  fscanf(fin, "%d", &n);
  fact(n, a);
  calcSemne(n, a);
  a.print(fout);
}