mod = 998244353

def multiply(a, b):
    return [
        [
            (a[0][0] * b[0][0] + a[0][1] * b[1][0]) % mod,
            (a[0][0] * b[0][1] + a[0][1] * b[1][1]) % mod
        ],
        [
            (a[1][0] * b[0][0] + a[1][1] * b[1][0]) % mod,
            (a[1][0] * b[0][1] + a[1][1] * b[1][1]) % mod
        ]
    ]

def matrix_pow(mat, power):
    result = [[1, 0], [0, 1]]  # Identity matrix
    while power > 0:
        if power % 2 == 1:
            result = multiply(result, mat)
        mat = multiply(mat, mat)
        power //= 2
    return result

def fib(m):
    if m == 1 or m == 2:
        return 1
    mat = matrix_pow([[1, 1], [1, 0]], m - 2)
    return (mat[0][0] + mat[0][1]) % mod

n = int(input())
m = n + 1
if m <= 2:
    print((0) % mod)
else:
    res = fib(m)
    ans = (res - 1) % mod
    print(ans)