#include<bits/stdc++.h>
    using namespace std;
    //#define long long int
    const  int mod=1e9+7;
         const int N=1e6+7;
 
    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)%mod;
         }
        while(t--){
                int n;
        cin>>n;
 
           cout<<"Case "<<i<<": "<<arr[n]/2<<endl;
           i++;
        }
 
 
    }