mod = 663224321

d = {}
c = {}

def ncr(n, k):
    if k > n - k:
        return ncr(n, n - k)
    if n == k or k == 0:
        return 1
    if n < k or k < 0:
        return 0
    if n == 1:
        return 1
    if (n, k) not in c:
        c[n, k] = (ncr(n - 1, k) + ncr(n - 1, k - 1)) % mod
    return c[n, k]

def C(n):
    if n not in d:
        x = pow(2, (n * (n - 1)) // 2, mod)
        for k in range(1, n):
            x -= ncr(n - 1, k - 1) * pow(2, ((n - k) * (n - k - 1)) // 2, mod) * C(k)
            x %= mod
        d[n] = x
    return d[n]

for _ in range(int(input())):
    n = int(input())
    if n < 3:
        print(1)
    else:
        print(C(n))