//An Emperor Production
//in Association with Assistant Professor MR Ram Kripal Mishra.
//Copyright (C) 2016,2015 CodeGeeks, Inc.,
//B-217 KIT, Rooma, Kanpur, INDIA
//Everyone is permitted to copy and distribute verbatim copies
//of this code, but changing it is not allowed. :P
#include<bits/stdc++.h>
using namespace std;
#define ln pf("\n")
#define I inr()
#define C inc()
#define S ins()
#define sp pf(" ")
#define loop(i,a,b) for(int i=a;i<b;i++)
#define pool(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define um unordered_map
#define ppb pop_back()
#define pf printf
#define pi pair<int,int>
#define sf scanf
#define swi switch
#define vec vector
#define veci vector<int>
#define vecs vector<string>
typedef long long ll;
ll MOD = 663224321;
typedef unsigned long long ull;
typedef string str;
void ins(string &s){getline(cin,s);}
int to_num(string s){return atoi(s.c_str());}
ll power(ll x, ll y){ll temp;if( y == 0)return 1;temp = power(x, y/2)%MOD;if (y%2 == 0)return (temp*temp)%MOD;else{if(y > 0)return (x*temp*temp)%MOD;else return (temp*temp)/x;}}
void to_binary(ll n){if(n==1){cout<<1; return;}to_binary(n>>1);cout<<n%2;}
ll inr(){ll V;cin>>V;return V;}
str ins(){str s;cin>>s;return s;}
char inc(){char c;cin>>c;return c;}

int n,m;
int les[100000],more[100000];
int lena_sort(int nums[],int nn) {
    if(nn==0)
        return 0;
    if (nn == 1) {
        return nums[0];
    }


    int pivot = nums[0];
  //  cout<<pivot<< " ";
    int ls=0;
    int mo=0;
    for (int i = 1; i < nn; ++i) {
    	// Comparison
        if (nums[i] < pivot) {
            les[ls++]=nums[i];
        }
        else {
            more[mo++]=nums[i];
        }
    }
    int sorted_less = lena_sort(les,ls);
    int sorted_more = lena_sort(more,mo);
    int ans = sorted_less + pivot + sorted_more;

    return ans;
}

ll ar[100001];
void pre()
    {
    ar[0]=1;
    loop(i,1,100001)
        {
        ar[i]=ar[i-1]*i;
        ar[i]%=MOD;
    }
}

int main()
{
   int q=I;
    pre();
    while(q--)
        {
        int n=I;
        cout<<((ar[n-1]*ar[n-1])%MOD)<<endl;
    }
    return 0;
}