#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 1000006;
const long long M = 1000000007;
long long n;
long long dp[MAXN];
void work(){
    dp[1] = 1;
    dp[2] = 2;
    for(int i=3; i<=MAXN; i++){
        dp[i] = (dp[i-1] + (i-1)*dp[i-2] % M) % M;
    }
}
int main(){
    work();
    int cnt = 1;
    int T;
    scanf("%d", &T); 
    while(T--){
        scanf("%I64d", &n);
        long long ans = dp[n];
        printf("Case #%d:\n", cnt++);
        printf("%I64d\n", ans);
    }
    return 0;
}