N = int(input())
mod = 998244353
inv2, inv3, inv5 = pow(2, mod-2, mod), pow(3, mod-2, mod), pow(5, mod-2, mod)

# dp[n][j] := n日→n+1日で1伸びる確率(直前の方向がj)
dp = [[0]*5 for _ in range(N+1)]
dp[0] = [inv5]*5

ans = 0
for n in range(N):
    dp[n+1][0] = dp[n][0] * inv2 + dp[n][1] * inv3
    dp[n+1][1] = dp[n][0] * inv2 + dp[n][1] * inv3 + dp[n][2] * inv3
    dp[n+1][2] = dp[n][1] * inv3 + dp[n][2] * inv3 + dp[n][3] * inv3
    dp[n+1][3] = dp[n][2] * inv3 + dp[n][3] * inv3 + dp[n][4] * inv2
    dp[n+1][4] = dp[n][3] * inv3 + dp[n][4] * inv2
    for j in range(5):
        dp[n+1][j] %= mod
    ans += dp[n][1] + dp[n][2] + dp[n][3]
    ans %= mod
print(ans)