#include <cstdio>

using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int maxn = 1000100;

ll buf[maxn];

void init()
{
    buf[1] = 1;
    buf[2] = 2;
    for(ll i = 3; i <= maxn; i++)
        buf[i] = (buf[i-1]+(i-1)*buf[i-2]%mod)%mod;
}

int main()
{
    int t, n, CASE = 0;
    init();
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        printf("Case #%d:\n", ++CASE);
        printf("%I64d\n", buf[n]);
    }
    return 0;
}