#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e6 + 5, M = 1e9 + 7;
typedef long long LL;
LL f[N];
int main() {
    f[1] = 1, f[2] = 2;
    for (int i = 3; i <= (int)1e6; ++i)    f[i] = (f[i - 1] + (LL)(i - 1) * f[i - 2] % M) % M;
    int T;
    scanf("%d", &T);
    for (int tt = 1; tt <= T; ++tt){
        printf("Case #%d:\n", tt);
        int n;
        scanf("%d", &n);
        printf("%I64d\n", f[n]);
    }
    return 0;
}