#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using mint = atcoder::modint998244353;

void solve(){
	ll a;
	cin>>a;
	cout<<((1-mint(26).pow(a+1))*mint(-25).inv()-1).val()<<"\n";
}

int main(){
	int q;
	cin>>q;
	rep(i,q) solve();
}