/*by SilverN*/

 #include<algorithm>

 #include<iostream>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 using namespace std;

 const int mod=;

 const int mxn=;

 int read(){

     int x=,f=;char ch=getchar();

     while(ch<'' || ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>='' && ch<=''){x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 int c[mxn][mxn];

 int f[mxn];

 int n,T;

 void clc(){

     for(int i=;i<mxn;i++)c[i][]=;

     for(int i=;i<mxn;i++)

      for(int j=;j<=i;j++){

          c[i][j]=(c[i-][j-]+c[i-][j])%mod;

      }

     f[]=;

     for(int i=;i<mxn;i++)

      for(int j=;j<=i;j++)

         f[i]=(f[i]+c[i][j]*f[i-j])%mod;

     return;

 }

 int main(){

     clc();

     T=read();

     int cas=;

     while(T--){

         cas++;

         n=read();

         printf("Case %d: %d\n",cas,f[n]);

     }

     return ;

 }