#include<bits/stdc++.h>
using namespace std;
#define rg register
#define maxn 215
#define ll long long
#define IT set<node>::iterator
#define int ll
const int mod=1e9+7;
#pragma GCC optimize(3)
#pragma -fcrossjumping
#pragma -fdefer-pop
#pragma -fmerge-constans
#pragma -fthread-jumps
#pragma -floop-optimize
#pragma -fif-conversion
#pragma -fif-conversion2
#pragma -fdelayed-branch
#pragma -fguess-branch-probability
#pragma -fcprop-registers
#pragma -fforce-mem
#pragma -foptimize-sibling-calls
#pragma -fstrength-reduce
#pragma -fgcse
#pragma -fcse-follow-jumps
#pragma -frerun-cse-after-loop
#pragma -fdelete-null-pointer-checks
#pragma -fextensive-optimizations
#pragma -fregmove
#pragma -fschedule-insns
#pragma -fsched-interblock
#pragma -fcaller-saves
#pragma -fpeephole2
#pragma -freorder-blocks
#pragma -fstrict-aliasing
#pragma -funit-at-a-time
#pragma -falign-functions
#pragma -fcrossjumping
#pragma -finline-functions
#pragma -fweb
#pragma -fgcse-after-reload
inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
    {
        if(c=='-') f=-1;
        c=getchar();
    }
    while(c<='9'&&c>='0')
    {
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline int max(int a,int b)
{
	if(a>b) return a;
	return b;
}
inline int jc(int x)
{
	if(x==0) return 1;
	int ans=1;
	while(x) ans*=(x--),ans%=mod;
	return ans;
} 
inline int mul(int a,int b)
{
	int sum=1;
	while(b)
	{
		if(b&1) sum=(sum*a)%mod;
		a=(a*a)%mod;
		b>>=1;
	}
	return sum;
}
int t,n,f[maxn];
inline int C(int x,int y)
{
	return jc(x)*mul(jc(y),mod-2)%mod*mul(jc(x-y),mod-2)%mod;
}
inline void pre_work() 
{
	f[1]=1,f[2]=2,f[3]=5;
	for(rg int i=4;i<=100;++i)
	{
		f[i]=1;
		for(rg int j=0;j<i;++j) f[i]=(f[j]*C(i-1,j)+f[i])%mod;
	}
}
signed main()
{
	pre_work();
	t=read();
	while(t--)
	{
		n=read();
		cout<<f[n]<<endl;
	}
}