#include <stdio.h>
#include <string.h>
#define N 1100
int A[N];
void mul(int A[], int B)
{
    int i, t = 0;
    for (i = 1; i <= A[0] || t; i++, t /= 10)
        A[i] = (t += A[i] * B) % 10;
     A[0] = i - 1;
}
void mul_mare(int A[], int B[])
{
    int i, j, t, C[N];
    memset(C, 0, sizeof(C));
    for (i = 1; i <= A[0]; i++)
    {
            for (t=0, j=1; j <= B[0] || t; j++, t/=10)
                    C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
            if (i + j - 2 > C[0]) C[0] = i + j - 2;
    }
    memcpy(A, C, sizeof(C));
}
int main()
{
	int n,i,b;
	A[0]=1; A[1]=1;
	freopen("patrate2.in", "r",stdin);
	freopen("patrate2.out", "w",stdout);
	scanf("%d", &n);
	b=n*n;
	b-=1;
	mul(A,2);
	
	while (b>1)  
	if (b%2==1) { mul(A,2); --b;}  
	else { mul(A,4); b=b-2;} 
	/*for(i=1;i<=b;++i)
		mul(A,2); */
	//for(i=A[0];i>=1;--i)
	//	printf("%d", A[i]);
	//printf("\n");
	for(i=1;i<=n;++i)
		mul(A,i);
	
	for(i=A[0];i>=1;--i)
		printf("%d", A[i]);
	
	//for(i=rez[0];i>=1;--i)
	//	printf("%d", rez[i]);
	return 0;
}

//2^(N*N)*N!