#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
typedef long long LL;
const int N = 1e6 + 9;
LL dp[N];
const LL MOD = 1000000007LL;
int Case;
int main(){
    dp[1] = 1;
    dp[2] = 2;
    for (int i = 3 ; i < N ; ++i)
        dp[i] = (dp[i - 1] + dp[i - 2] * (i - 1) % MOD) % MOD;
    int T;
    scanf("%d" , &T);
    while(T--) {
            int n;
            scanf("%d" , &n);
            printf("Case #%d:\n%I64d\n" , ++Case , dp[n]);
    }
}