#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
#define ll long long
#define FOR(i,j,k) for(int i =j; i<=k ;i++)
#define ll long long
const int inf = 2000000000;
const int mod = 1000000007;
ll a[1000010];
int main()
{
    int T;
    scanf("%d", &T);
    a[0] =a[1] = 1;
    FOR(i, 2, 1000000){
        a[i] = (a[i-1] +  a[i-2]*(i-1) )% mod;
    }
    FOR(i,1,T)
    {
        int n;
        scanf("%d",&n);
        printf("Case #%d:\n", i);
        printf("%I64d\n",a[n]);
    }
    return 0;
}