#include<stdio.h>
#include<string.h>
using namespace std;

int n,N,i,sol[5001],doi[5001],fact[5001],zece[5001];

void mul(int A[], int B){

      int i, t = 0;
      for (i = 1; i <= A[0] || t; i++, t /= 1000)
              A[i] = (t += A[i] * B) % 1000;
      A[0] = i - 1;
}

void mul2(int A[], int B[])
{
      int i, j, t, C[5001];
      memset(C, 0, sizeof(C));
      //for(i=C[0]; i>=0; i--)
		//C[i] = 0;
	  
	  for (i = 1; i <= A[0]; i++)
      {
              for (t=0, j=1; j <= B[0] || t; j++, t/=1000)
                      C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%1000;
              if (i + j - 2 > C[0]) C[0] = i + j - 2;
      }
      memcpy(A, C, sizeof(C));
	
	  //for(i=C[0]; i>=0; i--)
		//A[i] = C[i];

}

int main(){

	FILE *f = fopen("patrate2.in","r");
	FILE *g = fopen("patrate2.out","w");

	fscanf(f,"%d",&n);
	N = n*n;
	sol[0] = 1; sol[1] = 1;
	doi[0] = 1; doi[1] = 2;
	//for(i=2; i<=N; i++)
		//mul(sol,2);
	  
	while(N){
		if(N&1 == 1)
			//rez=(rez*n) % MOD;
			mul2(sol,doi);
		
		N = N>>1;
		//n=(n*n) % MOD;
		mul2(doi,doi);
	}

	fact[0] = fact[1] = 1;
	for(i=2; i<=n; i++)
		mul(fact,i);
	
	mul2(sol,fact);
	int j;
	for(i=sol[0]; i>=1; i--)
		for(j=100; j>=1; j/=10){
 			zece[++zece[0]] = sol[i] / j % 10;
			//sol[i]/=10;
		}
	
	int p = 1;
	while(!zece[p])
		p++;
	
	for(i=p; i<=zece[0]; i++)
		fprintf(g,"%d",zece[i]);
	
	fclose(f);
	fclose(g);
	
	return 0;

}