#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <set>
#include <stdint.h>

using namespace std;

#define print(x) cout<<x<<endl
#define input(x) cin>>x

typedef long long llint;

const int SIZE = 1000000 + 7;
const int MOD = 1000000007;

llint dp[SIZE];

void init() {
    dp[1] = 1;
    dp[2] = 2;
    for (int i = 3; i < SIZE; i++) {
        dp[i] = (dp[i - 1] + static_cast<llint>(i - 1) * dp[i - 2] % MOD) % MOD;
    }
}

int main() {
    int T = 0;
    int n = 0;
    int cas = 1;

    init();
    input(T);
    while (T--) {
        input(n);
        printf("Case #%d:\n", cas++);
        print(dp[n]);
    }
    return 0;
}