#include <iostream>

const int maxn = 2000;
const int base = 10;

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

int N;
int H[maxn];
int B[maxn];

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

//int C[maxn];
//void mulmare(int A[], int B[])
//{
//    int i, j, t;
//    for (i = 1; i <= A[0]; i++)
//    {
//        for (t=0, j=1; j <= B[0] || t; j++, t/=100000)
//            C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%100000;
//        if (i + j - 2 > C[0]) C[0] = i + j - 2;
//    }
//}

int main()
{
    fscanf(in, "%d", &N);


    H[0] = 1;
    H[1] = 2;

    int end = N*N;


    for ( int i = 1; i < end; ++i )
        mul(H, 2);

    for ( int i = 2; i <= N; ++i )
        mul(H, i);

    for ( int i = H[0]; i; --i )
        fprintf(out, "%d", H[i]);

	return 0;
}