#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iterator>
#include <string>
#include <string.h>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <stdlib.h>
#include <stdio.h>
#include <cstdio>
#include <queue>
#define forn(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll MOD=1000000000+7;
const ll maxn=1000000+10;
ll a[maxn];
ll multi(ll x,ll n)
{
    ll t=x;
    ll ret=0;
    while(n)
    {
        if(n&1)ret=(ret+t)%MOD;
        t=t*2%MOD;
        n>>=1;
    }
    return ret;
}
int main()
{
    #ifdef LOCAL
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #endif // LOCAL
    a[1]=1;
    a[2]=2;
    for(int i=3;i<=maxn;i++)
    {
        a[i]=(a[i-1]+((i-1)*a[i-2])%MOD)%MOD;
    }
    int T;
    scanf("%d",&T);
    int cnt=1;
    while(T--)
    {
        int n;
        scanf("%d",&n);
        printf("Case #%d:\n%I64d\n",cnt++,a[n]);
    }
    return 0;
}