#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<iostream>
#define mod 1000000007
#define N 1000000
long long a[N+5];
using namespace std;

int main()
{
    a[1]=1;a[2]=2;a[3]=4;a[4]=10;a[5]=26;
    for(int i=6;i<=N;i++)
    {
        a[i]=a[i-1]+(i-1)*a[i-2]%mod;
        a[i]%=mod;
    }
    int t;int n;
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        scanf("%d",&n);
        printf("Case #%d:\n",i);
        printf("%lld\n",a[n]);
    }
    return 0;
}