#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;

const mint inv = mint(25).inv();

void solve() {
  ll N;
  cin >> N;

  cout << ((mint(26).pow(N) - 1) * 26 * inv).val() << "\n";
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll t;
  cin >> t;
  while(t--) { solve(); }
}