#include <iostream>
#include <vector>

#include "atcoder/modint.hpp"
using mint = atcoder::modint998244353;
using namespace std;

#define rep(i, n) for (int i = 0; i < (n); i++)

int main() {
  int MAX = 1001001;
  vector<mint> pw(MAX + 1);
  pw[0] = 1;
  rep(i, MAX) pw[i + 1] = pw[i] * 26;

  vector<mint> dp(MAX + 1);
  dp[1] = 0, dp[2] = 26 * 25;
  for (int n = 3; n <= MAX; n++) {
    dp[n] = dp[n - 2] * 26;
    if (n & 1) {
      dp[n] += pw[(n - 3) / 2] * 1300;
    } else {
      dp[n] += (pw[(n - 2) / 2] * 2 - 1) * 650;
    }
  }

  int T;
  cin >> T;
  rep(i, T) {
    int N;
    cin >> N;
    cout << dp[N].val() << "\n";
  }
}