n=int(input())
M=998244353
N=n
fa=[1]
for i in range(1,N+1):
  fa+=[fa[-1]*i%M]
fb=[pow(fa[N],M-2,M)]
for i in reversed(range(1,N+1)):
  fb+=[fb[-1]*i%M]
fb.reverse()
fc=lambda n,k:fa[n]*fb[k]*fb[n-k]%M if n>=k>=0 else 0
b=[0]*(n+1)
for i in range(n//2+1):
  b[i*2]=fc(n,i)*2%M
b=b[::-1]
b[0]=b[0]*pow(2,M-2,M)%M
print(*b)