#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
#define ll long long
#define pp 1000000007
#define N 1100000
int a[N];
ll mo(ll a){
   if(a>=0 && a<pp)return a;
   a%=pp;
   if(a<0)a+=pp;
   return a;
}
int main(){
    a[1]=1;
    a[2]=2;
    for(int i=3;i<=1000000;i++)a[i]=mo(a[i-1]+(ll)a[i-2]*(i-1));
    int T,tot=0;
    scanf("%d",&T);
    while(T--){
      int n;
      scanf("%d",&n);
      printf("Case #%d:\n%d\n",++tot,a[n]);
    }
    return 0;
}