#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,a[10]={1,1,4,24,180,1680},ans,x,y,z;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){ 
	freopen("robot.in","r",stdin);freopen("robot.out","w",stdout);
	m=read();
	while(m--)
	{
		n=read();
		if(n==10000000)ans=214772768;
		else ans=a[n];
		printf("%lld\n",ans); 
	}
	return 0;
}