MOD = 998244353

def mod_exp(base, exp, mod):
    result = 1
    while exp > 0:
        if exp % 2 == 1:
            result = (result * base) % mod
        base = (base * base) % mod
        exp //= 2
    return result

def mod_inv(x, mod):
    return mod_exp(x, mod - 2, mod)

def compute_string_count(L):
    base = 26
    power = L + 1
    base_power_mod = mod_exp(base, power, MOD)
    inverse_25 = mod_inv(25, MOD)
    result = (base_power_mod - 1) * inverse_25 % MOD
    return result

T = int(input())
results = []

for i in range(T):
    L = int(input())
    results.append(str(compute_string_count(L) - 1))

print("\n".join(results))