#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;
#define MOD 1000000007
#define N 1000005

long long f[N];
int T,i,n;

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