#include<cstdio>
#include<fstream>
#include<algorithm>
using namespace std;
struct huge { short int c[3000];
			} a;
void xo(huge &a,int x)
{ int d=0,nr=1;
  while(nr<=a.c[0]||d) { d+=x*a.c[nr];
						a.c[nr++]=d%10;
						d/=10;
					  }
  a.c[0]=nr-1;
}
int main()
{ freopen("patrate2.in","r",stdin);
  freopen("patrate2.out","w",stdout);
  int i,n,m,k=1<<30,p,r;
  scanf("%d",&n);
  m=n*n;
  p=m/30;
  r=m%30;
  a.c[0]=a.c[1]=1;
  for(i=2;i<=n;i++) xo(a,i);
  for(i=1;i<=p;i++) xo(a,k);
  
  int q=r/5;
  p=r%5;
  for(i=1;i<=q;i++)xo(a,32);
  
  for(i=1;i<=p;i++)xo(a,2);
  for(i=a.c[0];i;i--)printf("%d",a.c[i]);printf("\n");
  
  return 0;
}