T = int(input())

I = [[1, 0],[0, 1]]
A = [[1, 26],[0,26]]

def mulVec(a, b):
  ret = [[0] * 2 for _ in range(2)]
  for i in range(2):
    for j in range(2):
      for k in range(2):
        ret[i][k] += a[i][j] * b[j][k]
        ret[i][k] %= mod
  return ret

def powVec(a, b):
  if b == 0:
    return I
  if b % 2 == 0:
    return powVec(mulVec(a, a), b//2)
  return mulVec(a, powVec(a, b-1))

def solve():
  L = int(input())
  ans = powVec(A, L)
  return ans[0][1]

mod = 998244353
for _ in range(T):
  print(solve())