#include <bits/stdc++.h>

#include <atcoder/all>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define FAST_IO                \
  ios::sync_with_stdio(false); \
  cin.tie(0);
const i64 INF = 1001001001001001001;
using Modint = atcoder::static_modint<998244353>;

void solve(i64 L) {
  Modint x = 26;
  // ans = x^1 + x^2 + ... + x^L
  //    = (x^(L + 1) - 1) / (x - 1)

  Modint ans = (x.pow(L + 1) - 1) / (x - 1) - 1;
  cout << ans.val() << endl;
}

int main() {
  FAST_IO
  auto ans = 0LL;

  int T;
  cin >> T;

  for (int i = 0; i < T; i ++) {
    i64 L;
    cin >> L;
    solve(L);
  }

}