#include using namespace std; const int P=1000000007; const int S=1000000; int f[S+1],i,n,t,T,ans; int main() { f[1]=1;f[2]=2;for (i=3;i<=S;i++)f[i]=(f[i-1]+1ll*f[i-2]*(i-1)%P)%P; scanf("%d",&T); for (t=1;t<=T;t++) { scanf("%d",&n); printf("Case #%d:\n%d\n",t,f[n]); } }