M=998244353
N=int(input())
F=[1]
for i in range(N+1):F+=[F[-1]*(i+1)%M]
C=lambda n,r:F[n]*pow(F[r]*F[n-r],-1,M)%M if 0<=r<=n else 0
print(sum(C(i+1,N-2*i+1)*F[i]*F[N-i]for i in range(N+1))%M)