#include <iostream>
using namespace std;
const int MOD=998244353;
long long ksm(unsigned long long a,unsigned long long b,unsigned long long p){
	if (b<0){
		return 0;
	}
	unsigned long long base=a;
	unsigned long long ans=1;
	while (b){
		if (b&1){
			ans=ans%p*base%p;
			ans%=p;
		}
		base=base%p*base%p;
		base%=p;
		b>>=1;
	}
	return ans;
}
void solve(){
	unsigned long long n;
	scanf("%lld",&n);
	if (n==1){
		printf("0\n");
		return;
	}
	printf("%lld\n",(ksm(26,n,MOD)-ksm(25,n,MOD)-ksm(25,n,MOD)+ksm(24,n,MOD))%MOD);
}
signed main(){
	int t;
	cin >> t;
	for (int i=0;i<t;++i){
		solve();
	}
	return 0;
}