#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
#define N 1000050
#define P 1000000007
#define ll long long
int ans,n,t,JC[N],InJ[N],Inv[N],dp[N];
inline int Read()
 {
     int x=0;char y;
     do y=getchar(); while (y<'0'||y>'9');
     do x=x*10+y-'0',y=getchar(); while (y>='0'&&y<='9');
     return x;
 }
inline void Add(int &x,int y) 
 {x=(x+y)%P;}
inline ll C(int x,int y)
 {return 1LL*JC[x]*InJ[y]%P*InJ[x-y]%P;}
int main()
 {
     //freopen("input.txt","r",stdin);
     t=Read();Inv[0]=Inv[1]=InJ[0]=InJ[1]=JC[0]=JC[1]=true;
     for (int i=2;i<N;i++)
       Inv[i]=1LL*(P-P/i)*Inv[P%i]%P,InJ[i]=1LL*InJ[i-1]*Inv[i]%P,
       JC[i]=1LL*JC[i-1]*i%P;
     dp[0]=true;dp[1]=true;
     for (int i=2;i<N;i++)
       dp[i]=((i-1LL)*dp[i-2]+dp[i-1])%P;
     for (int T=1;T<=t;T++)
      {
          n=Read();ans=false;int Cnt=true;
          cout <<"Case #"<<T<<":"<<endl;
          cout <<dp[n]<<endl;
         /* for (int i=0;i<=n/2;i++)
            Add(ans,Cnt*C(n,i*2)%P),Cnt=Cnt*C(i*2+2,i*2)%P;
          cout <<ans<<endl;*/
      }
     return 0;
 }