#include <fstream>

using namespace std;

ifstream cin ("patrate2.in");
ofstream cout ("patrate2.out");

// formula este: n! * 2^(n * n) :)

const int nmax = 3200;

int n;

int A[nmax];

void mult(int A[], int X) {
  int i, t = 0;
  for(i = 1; i <= A[0] || t; i++, t /= 10000)
    A[i] = (t += A[i] * X) % 10000;
  A[0] = i - 1;
}

int main() {
  cin >> n;
  A[0] = A[1] = 1;
  for(int i = 2; i <= n; i++)
    mult(A, i);
  for(int i = 1; i <= n * n; i++)
    mult(A, 2);
  for(int i = A[0]; i >= 1; i--) {
    if(i < A[0]) {
      int temp = A[i], ncif = 0;
      if(temp == 0)
        ncif = 1;
      while(temp) {
        ncif++;
        temp /= 10;
      }
      for(int j = 1; j <= 4 - ncif; j++)
        cout << 0;
    }
    cout << A[i];
  }
  return 0;
}