/**
题意:如题
做法:找规律
**/
#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
#define maxn 1000000+10
#define mod 1000000007
long long mmap[maxn];
void solve()
{
mmap[0] = 1;
mmap[1] = 1;
for(int i=2; i<maxn; i++)
{
mmap[i] = (mmap[i-1] + (i-1)*mmap[i-2]) %mod;
}
}
int main()
{
//freopen("in.txt","r",stdin);
int T;
scanf("%d",&T);
int Case = 1;
solve();
while(T--)
{
long long n;
scanf("%lld",&n);
printf("Case #%d:\n",Case++);
printf("%lld\n",mmap[n]);
}
return 0;
}