n = int(input())
dp = [[[0]*3 for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][1] = 1
mod = 998244353
for i in range(n):
  for j in range(n+1):
    if j != n:
      dp[i+1][j+1][0] += dp[i][j][1]+dp[i][j][2]
      dp[i+1][j+1][0] %= mod
      
    dp[i+1][j][1] += dp[i][j][0]
    dp[i+1][j][2] += dp[i][j][1]
    dp[i+1][j][1] %= mod
    dp[i+1][j][2] %= mod
ans = 0
aa = [1]*(n+1)
for i in range(1,n+1):
  aa[i] = aa[i-1] * i
  aa[i] %= mod
for i in range(n+1):
  for j in range(2):
    res = n - i
    ans += dp[-1][i][j] * aa[i] * aa[res]
    ans %= mod
print(ans)