N =int(input())
mod = 998244353


def mat_mul(a,b):
    I,J,K = len(a),len(b[0]),len(b)
    c = [[0]*J for _ in range(I)]
    for i in range(I):
        for j in range(J):
            for k in range(K):
                c[i][j]+=a[i][k]*b[k][j]%mod
    return c
def mat_pow(x,n):
    y = [[0]*len(x) for _ in range(len(x))]
    for i in range(len(x)):
        y[i][i]=1


    while n > 0:
        if n&1:
            y = mat_mul(x,y)
        x = mat_mul(x,x)
        n //=2
    return y


matrix = [[1,1],[1,0]]
mat2 = [[1],[1]]

tmp = mat_pow(matrix,N-2)
ans = mat_mul(tmp,mat2)
print((sum(ans[0]+ans[1])-1)%mod)