#include <iostream>
#include <cstdio>
#include <algorithm>

#define LL long long

using namespace std;

const int maxn = 1000000 +10;

LL a[maxn];

int main()
{
    a[1]=1;
    a[2]=2;
    for (LL i=3;i<=1000000;i++) a[i] = (a[i-1] + (i-1) * a[i-2]) % 1000000007;
    int n , t ,cas = 0;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        printf("Case #%d:\n%I64d\n",++cas,a[n]);
    }
    return 0;
}