#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=1e6+5;
const int mod=1e9+7;
long long  s[N];
void Init()
{
    s[0] = s[1] = 1;
    for (int i=2; i<=N-5; i++)
        s[i]=(s[i-1]+(i-1)*s[i-2])%mod;
}
int main()
{
    Init();
    int t;
    cin>>t;
    int *p=new int[t];
    for(int j=0;j<t;j++)
    {
        int n;
        cin>>n;
        if(n==0)
            p[j]=0;
        else
            p[j]=s[n];
    }
    system("cls");
    for(int i=0;i<t;i++)
    {
        cout<<"Case #"<<i+1<<":"<<endl;
        cout<<p[i]<<endl;
    }
    delete[] p;
    return 0;
}