#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


const LL mod=1e9+7;

LL f[1000005],dq,T,n;

int main()

{
    f[0]=1;
    f[1]=1;
    for (int i=2;i<=1000000;++i)
    {
        dq=(i-1)*f[i-2]%mod;
        dq=(dq+f[i-1])%mod;
        f[i]=dq;
    }
    cin>>T;
    for (int z=1;z<=T;++z)
    {
        cout<<"Case #"<<z<<":"<<endl;
        cin>>n;
        cout<<f[n]<<endl;
    }

    return 0;

}