#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cmath>
#include <ctime>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <utility>
#include <algorithm>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int,int> PII;

const LD eps=1e-9;
const LD PI=atan2((LD)0,(LD)-1);
const LL MOD=1000000007;
const int INF=1<<30;
const int ARR_INF=1<<6;
const int MAXN=1000005;

LL ans[MAXN];

void Init()
{
    ans[0]=ans[1]=1;
    for(int i=2;i<MAXN;i++)
        ans[i]=(ans[i-1]+(i-1)*ans[i-2])%MOD;
    return;
}

int main()
{
    int T,n;
    scanf("%d",&T);
    Init();
    for(int t=1;t<=T;t++)
    {
        scanf("%d",&n);
        printf("Case #%d:\n%I64d\n",t,ans[n]);
    }
    return 0;
}