#include <stdio.h>  
#include <string.h>  
#include <iostream>  
#include <algorithm>  
using namespace std;  
const int N=1e6+5;  
const int mod=1e9+7;  
long long  s[N];//注意long long   
void Init()  
{  
    s[0] = s[1] = 1;  
    for (int i=2; i<=N-5; i++)  
        s[i]=(s[i-1]+(i-1)*s[i-2])%mod;  
}  
int main()  
{  
    Init();  
    int t,n,tot=1;  
    scanf("%d",&t);  
    while(t--)  
    {  
        scanf("%d",&n);  
        printf("Case #%d:\n%d\n",tot++,s[n]);  
    }  
    return 0;  
}