#include <cstdio>

const int MOD = 1000000007;
const int MAXN = 1000000;

long long sit[MAXN+5];

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

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