#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
const int N=1000010;
#define mod 1000000007
#define LL long long
using namespace std;
LL a[N];
int main()
{
    LL t,n,m,i;
    a[1]=1,a[2]=2;
    for(i=3; i<N; i++) {
        a[i]=a[i-1]+((i-1)*a[i-2])%mod;
        a[i]%=mod;
    }
    cin>>t;
    for(int k=1; k<=t; k++) {
        scanf("%lld",&n);
        printf("Case #%d:\n%lld\n",k,a[n]);
    }
    return 0;
}