#include <fstream>
using namespace std;

#define base 1000000000
#define nbase 9

int a[1000], b[1000] ;
int N;

ifstream f("patrate2.in");
ofstream g("patrate2.out");

inline int mod(int x,int y)
{
    return x-y*(x/y);
}
inline void mul(int A[], int B)
{
    int i ;
    long long t = 0;
    for (i = 1; i <= A[0] || t; i++, t /= base)
        A[i] = (t += (long long) A[i] * (long long) B) % base;
    A[0] = i - 1;
}
inline void inm(int A[], int B[])
{
    int i, j , C[1000] ;
    long long t;
    memset(C, 0, sizeof(C));
    for (i = 1; i <= A[0]; i++)
    {
        for (t=0, j=1; j <= B[0] || t; j++, t /= base)
            C[i+j-1]=(t+= (long long) C[i+j-1] + (long long) A[i] * (long long) B[j]) % base;
        if (i + j - 2 > C[0]) C[0] = i + j - 2;
    }
    memcpy(A, C, sizeof(C));
}
inline void afis(int A[])
{
    int t, i, j, p;
    g<<A[A[0]];
    for (i = A[0] - 1; i ; --i)
    {
        t=0;
        p=A[i];
        while (p) p/=10, ++t;
        for (j=1;j<=nbase-t;++j) g<<"0";;
        if (A[i]) g<<A[i];
    }
}
inline void factorial()
{
    a[0]=1;
    a[1]=N;
    for (int i=2;i<N;i++) mul(a,i);
}
inline void putere()
{
    int n=N*N;
    bool stop;
    b[0]=b[1]=1;
    if (!mod(n,2)) n>>=1,stop=1;
    else n=n-1>>1,stop=0;
    for (int i=1;i<=n;i++) mul(b,2);
    inm(b,b);
    if (!stop) mul(b,2);
}
int main()
{
    f>>N;
    factorial();
    putere();
    inm(a,b);
    afis(a);
    return 0;
}