#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "../debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

using ll = long long;
using lf = long double;

const ll mod = 998244353;
const int Z = 26 * 2;


struct Matrix{
	int n, m;
	vector<vector<ll>> mx;
	Matrix(){}
	Matrix(int r, int c, int identity = false): n(r), m(c){
		mx.assign(n, vector<ll> (m));
		if( identity ){
			for(int i=0; i<n; ++i){
				mx[i][i] = 1;
			}
		}
	}
	Matrix operator * (const Matrix & o ) const {
		Matrix ret(n, o.m);
		for(int i=0; i<n; ++i){
			for(int j=0; j<o.m; ++j){
				ll& sum = ret.mx[i][j];
				for(int k=0; k<m; ++k){
					sum = ( sum + mx[i][k] * o.mx[k][j] % mod ) % mod;
				}
			}
		}
		return ret;
	}
};

Matrix mx_fpow(Matrix x, int e){
	Matrix ret(x.n,x.m,1);
	while(e){
		if(e&1) ret = ret * x;
		x = x * x;
		e >>= 1;
	}
	return ret;
}

string s = "AAAAAA", t = "aaaaaa";

vector<string> st;
void solve(int i, int j, string& cur){
	if( i == 6 && j == 6){
		st.push_back(cur);
	}else{
		if(i<6){
			cur.push_back(s[i]);
			solve(i+1,j,cur);
			cur.pop_back();
		}
		if(j<6){
			cur.push_back(t[j]);
			solve(i,j+1,cur);
			cur.pop_back();
		}
	}
}

bool isUpper(char x){
	return 'A' <= x && x <= 'Z';
}

bool isLower(char x){
	return 'a' <= x && x <= 'a';
}

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	string c = "";
	solve(0,0,c);
	sort(st.begin(),st.end());
	st.resize( unique(st.begin(),st.end()) - st.begin() );
	int T;
	cin >> T;
	while(T--){
		int n;
		cin >> n;
		ll tot = 0;
		for(auto& cur : st){
			const int N = 12;
			vector<int> values(N);
			int lw = 0, up = 0;
			for(int i=N-1; i>=0; --i){
				lw |= isLower(cur[i]);
				up |= isUpper(cur[i]);
				values[i] = Z - lw - up;
			}
			Matrix ans(N+1,N+1);
			for(int i=0; i<N; ++i){
				ans.mx[i][i] = values[i];
				ans.mx[i][i+1] = 1;
			}
			ans.mx[12][12] = Z;
			ans = mx_fpow(ans,n);
			tot = (tot +  ans.mx[0][12] ) % mod;
		}
		cout << tot << '\n';
	}
	return 0;
}