#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
  x%=z;
       ll a=1,b=x,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	

	int M=1e6+10;
	ll D=26;
	vector<ll> p(M);
	rep(i,M) p[i]=jyo(D,(i+1)/2,mod);
	vector<ll> dp(M);
	dp[1]=0,dp[2]=650;
	for(int i=3;i<M;i++){
		dp[i]=D*2ll*p[i-1]+D*dp[i-2]-D*2ll*p[i-3];
		if(i%2==0){
			dp[i]-=D*(D-1);
		}
		dp[i]%=mod;
		dp[i]+=mod;
		dp[i]%=mod;
	}
	int T;
	cin>>T;
	rep(i,T){
		int a;
		cin>>a;
		cout<<dp[a]<<"\n";
	}
}