#include<stdio.h>
const long long int MOD = 1000000007;
long long int a[1000001] = {0};
void fun(long long int *a);
int main()
{

    int t, kcase = 0, n;
    fun(a);
    scanf("%d", &t);
    while(t--){
        scanf("%d", &n);
        printf("Case #%d:\n", ++kcase);
        printf("%lld\n", a[n]);
    }
    return 0;
}
void fun(long long int *a)
{
    a[0] = 1;
    a[1] = 1;
    for (int i = 2; i <= 1000000; i++){
        a[i] = (a[i - 1] + (i - 1) * a[i - 2]) % MOD;
    }
}