mod = 998244353

fact = [1]
for i in range(1, 301):
    fact.append(fact[-1] * i % mod)

inv = [1] * 301
for i in range(1, 301):
    inv[i] = pow(fact[i], mod - 2, mod)

n = int(input())

dp = [[0] * n for _ in range(n + 1)]
dp[0][0] = 1

for i in range(n):
    for j in range(i + 1):
        dp[i + 1][j] += dp[i][j]
        if dp[i + 1][j] >= mod:
            dp[i + 1][j] -= mod
        for k in range(2, n - i + 1):
            dp[i + k][j + k - 1] += dp[i][j] * fact[n - i - 1] * inv[k - 1] * inv[n - i - k] * pow(k, k - 2, mod)
            if dp[i + k][j + k - 1] >= mod:
                dp[i + k][j + k - 1] %= mod

print(*dp[n], sep = "\n")