#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
const int mod=1000000007;
ll a[1000000+5];
int main()
{
    int t,n;
    a[1]=1;
    a[2]=2;
    for(int i=3;i<1000005;i++)
    {
        a[i]=a[i-1]+((i-1)%mod*(a[i-2]%mod))%mod;
    }
    cin>>t;
    int k=1;
    while(t--)
    {
        cin>>n;
        printf("Case #%d:\n%I64d\n",k++,a[n]%mod);
    }
    return 0;
}