#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<mint>dp(1000001);
	dp[1] = 0;
	dp[2] = 26 * 25;
	rep2(i, 3, 1000001) {
		dp[i] += dp[i - 2] * 26;
		if (1 == i % 2) {
			dp[i] += pow_mod(26, (i - 1) / 2, mod) * 25 * 2;
		}
		else {
			dp[i] += pow_mod(26, i / 2, mod) * 25 * 2;
			dp[i] -= 26 * 25;
		}
	}
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		cout << dp[n].val() << endl;
	}
	return 0;
}