#include<bits/stdc++.h>
    using namespace std;
    //#define long long int
    const  int mod=1e9+7;
         const int N=1e6+50;
 
    int main()
    {
        int t;
        cin>>t;
        int i=1;
         long long arr[N];
         arr[0]=1;
         for(int j=1;j<N;j++){
          arr[j]=arr[j-1]*j;
          if(arr[j-1]>2){
          arr[j-1]=arr[j-1]/2;
         }
         arr[j]%=mod;
 
 
         }
        while(t--){
                int n;
        cin>>n;
        if(n==2){
          cout<<"Case "<<i<<": "<<1<<endl;
          i++;
          continue;
        }
        long long x=arr[n];
       // long long ans=x/2;
           cout<<"Case "<<i<<": "<<x<<endl;
           i++;
        }
 
 
    }