mod = 998244353
p = pow(5,-1,mod)
inv_2 = (mod + 1) // 2
inv_3 = (mod + 1) // 3

N = int(input())
dp = [[0,0,0,0,0] for n in range(N + 1)]
dp[1] = [p,p,p,p,p]
for n in range(1,N):
  dp[n + 1][0] += (inv_2 * dp[n][0] + inv_3 * dp[n][1]) % mod
  dp[n + 1][1] += (inv_2 * dp[n][0] + inv_3 * dp[n][1] + inv_3 * dp[n][2]) % mod
  dp[n + 1][2] += inv_3 * (dp[n][3] + dp[n][1] + dp[n][2]) % mod
  dp[n + 1][3] += (inv_2 * dp[n][0] + inv_3 * dp[n][1] + inv_3 * dp[n][2]) % mod
  dp[n + 1][4] += (inv_2 * dp[n][0] + inv_3 * dp[n][1]) % mod

ans = 0
for i in range(N + 1):
  ans = (ans + sum(dp[i][1:4]) % mod) % mod
print(ans)