def main():
  n=int(input())
  C=[0]*(2*n)
  a=1
  d=0
  f=10
  while a-d<2*n:
    C[a-d]+=1
    a+=1
    if a%f==0:
      d+=1
      f*=10
  mod=998244353
  dp=[[0]*(2*n) for i in range(n+1)]
  dp[0][0]=1
  for i in range(n):
    for j in range(2*n):
      for k in range(1,2*n):
        if j+k<2*n:
          dp[i+1][j+k]+=dp[i][j]*C[k]
          dp[i+1][j+k]%=mod
  print(dp[n][2*n-1])
  return

main()