#include<stdio.h>
#include<string.h>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const LL mod = 1000000007;
LL f[105];
int main()
{
    f[1] =0,f[2]=1;
    for(int i=3;i<=100;i++){
        f[i] = (f[i-1]+f[i-2])%mod*(i-1)%mod;
    }
    int tcase;
    scanf("%d",&tcase);
    while(tcase--){
        int n;
        scanf("%d",&n);
        printf("%lld\n",f[n]);
    }
    return 0;
}