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

main()