#include<iostream>
#include<cstdio>
#include<fstream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#define MOD 1000000007
#define MAXN 1000007
using namespace std;

int T, N;
int no=0;

int ans[MAXN];

int main()
{
    ans[1]=1;
    ans[2]=2;
    
    for(int i=3;i<=1000000;i++)ans[i]=((long long)ans[i-2]*(i-1)%MOD+ans[i-1])%MOD;
    
    scanf("%d",&T);
    
    while(T--)
    {
        scanf("%d",&N);
        no++;
        printf("Case #%d:\n",no);
        
        printf("%d",ans[N]);
        
        printf("\n");
    }
    
    return 0;
}