def mat_mul(a, b, mod: int):
    ar, ac, br, bc = len(a), len(a[0]), len(b), len(b[0])
    assert ac == br

    res = [[0] * bc for _ in range(ar)]
    for i in range(ar):
        out = res[i]
        for j in range(bc):
            r = a[i]
            x = 0
            for k in range(ac):
                x += r[k] * b[k][j]
                x %= mod
            out[j] = x

    return res


def mat_power(m, n: int, mod: int):
    assert n > 0
    if n == 1: return m

    res = mat_power(m, n // 2, mod)
    res = mat_mul(res, res, mod)
    if n % 2 == 1:
        res = mat_mul(res, m, mod)

    return res


MOD = 998244353
N = int(input())

m = [[1, 1], [1, 0]]
m_n = mat_power(m, N-1, MOD)
res = mat_mul([[1, 0]], m_n, MOD)

ans = (res[0][0] + res[0][1] - 1) % MOD
print(ans)