#include<bits/stdc++.h>
using namespace std;
const int maxn=4e6+500;
const int mod=998244353;
int pre[maxn+1],inv[maxn+1],len;
struct ss
{
int x;
int y;
int w;
}bos[maxn+1];
int quick(int a,int b)
{
int ans=1;
while(b)
{
if(b&1)ans=1ll*ans*a%mod;
a=1ll*a*a%mod;
b>>=1;
}
return ans;
}
int C(int n,int m)
{
return 1ll*pre[n]*inv[m]%mod*inv[n-m]%mod;
}
void solve()
{
}
int main()
{
pre[0]=1;
//int N=1e5;
for(int i=1;i<=maxn;i++)
{
pre[i]=1ll*pre[i-1]*i%mod;
}
// cout<<pre[N]<<endl;
inv[maxn]=quick(pre[maxn],mod-2);
//cout<<inv[N]<<endl;
for(int i=maxn-1;i>=0;i--)
{
inv[i]=1ll*inv[i+1]*(i+1)%mod;
}
int t;
for(scanf("%d",&t);t;t--)
{
solve();
}
return 0;
}