def extgcd(a, b):
    if b:
        d, y, x = extgcd(b, a % b)
        y -= (a // b) * x
        return d, x, y
    return a, 1, 0

#以下modinv
def mod_inv(a, m):
    g, x, y = extgcd(a, m)

    if g != 1:
        raise Exception()

    if x < 0:
        x += m

    return x

N=int(input())
p=998244353
invs = [0]+[mod_inv(i,p) for i in range(1,10)]
dp=[[0 for _ in range(5)] for _ in range(N)]
go=[[4,5],[3,4,5],[2,3,4],[1,2,3],[1,2]]
for i in range(N-1,0,-1):
    for j in range(5):
        for g in go[j]:
            if j in {1,2,3}:
                dp[i-1][g-1]+=(dp[i][j]+1)*invs[len(go[g-1])]
                dp[i-1][g-1]%=p
            else:
                dp[i-1][g-1]+=(dp[i][j])*invs[len(go[g-1])]
                dp[i-1][g-1]%=p
ans=0
for i in range(5):
    if i in {1,2,3}:
        ans+=(1+dp[0][i])*invs[5]
        ans%=p
    else:
        ans+=(dp[0][i])*invs[5]
        ans%=p
print(ans)