#include <fstream>
#include <cstring>
using namespace std;
ifstream f("patrate2.in");
short Fact[100005],Power2[100005];
short N;
void mulLess(short int A[], short int B)
{
      int i, t = 0;
      for (i = 1; i <= A[0] || t; i++, t /= 10000)
              A[i] = (t += A[i] * B) % 10000;
      A[0] = i - 1;
}
void mulLarge(short int A[], short int B[])
{
      short int i, j, t, C[100005];
      memset(C, 0, sizeof(C));
      for (i = 1; i <= A[0]; i++)
      {
              for (t=0, j=1; j <= B[0] || t; j++, t/=10000)
                      C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10000;
              if (i + j - 2 > C[0]) C[0] = i + j - 2;
      }
      memcpy(A, C, sizeof(C));
}
void Solve()
{
    short int i;
    freopen ("patrate2.out", "w", stdout);
    Fact[0]=Fact[1]=1;
    for(i=2;i<=N;i++)
        mulLess(Fact,i);
    Power2[0]=Power2[1]=1;
    for(i=1;i<=N*N;i++)
        mulLess(Power2,2);
    mulLarge(Fact,Power2);
    for (int i=Fact[0]; i>0; --i)
    {
        if (i==Fact[0])
        {
            printf ("%d", Fact[i]);
            continue;
        }
        if (Fact[i]==0)
        {
            for (int j=1; j<10000; j*=10) printf ("0");
            continue;
        }
        for (int j=Fact[i]*10; j<10000; j*=10) printf ("0");
        printf ("%d", Fact[i]);
    }
}
int main()
{
    f>>N;
    Solve();
    return 0;
}