#include <iostream>
using namespace std;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

mint solve(long long L) {
    const mint D = 26;
    return (D.pow(L + 1) - D) / (D - 1);
}

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);

    int T;
    cin >> T;
    while (T--) {
        long long L;
        cin >> L;
        cout << solve(L).val() << '\n';
    }
}