#include <cstdio>
typedef long long ll;
const int mod = 1000000007;
const int maxN = 1000000 + 10;
int dp[maxN];
int main() {
    dp[0] = dp[1] = 1;
    for(int i = 2; i < maxN; i++) dp[i] = (int)(((ll)dp[i-1]+(ll)(i-1)*(ll)dp[i-2])%(ll)mod);
    int T;
    scanf("%d",&T);
    for(int kcase = 1; kcase <= T; kcase++) {
        int N;
        scanf("%d",&N);
        printf("Case #%d:\n",kcase);
        printf("%d\n",dp[N]);
    }
    return 0;
}