MOD = 998244353
N = int(input())
ans = 0
ln = [0] * 61
dv = [0] * 61
for i in range(61):
    ln[i] = pow((1 << i) + 1, MOD - 2, MOD)
    dv[i] = ln[i] * ln[i] * ((MOD + 1) // 2) % MOD
for k in range(100):
    if N <= (1 << k) - 1:
        ans += dv[k]
        ans %= MOD
        break
    l, r = 0, k
    p, q = 1, 1
    now = N
    
    while 0 < now:
        if l <= r:
            now -= q
            q *= 2
            r -= 1
        else:
            now -= p
            p *= 2
            l -= 1
    if l <= r:
        ans += (dv[k] - dv[k + 1]) * pow(p, MOD - 2, MOD)
        ans %= MOD
    else:
        ans += (ln[k] - ln[k + 1] - (dv[k] - dv[k + 1])) * pow(q, MOD - 2, MOD)
        ans %= MOD
print(ans * 2 % MOD)