from collections.abc import Iterable


def accum_dp(xs: Iterable, f, op, e, init: dict, *, is_reset=True):
    dp = init.copy()
    for x in xs:
        pp = {} if is_reset else dp.copy()
        dp, pp = pp, dp
        for fm_key, fm_val in pp.items():
            for to_key, to_val in f(fm_key, fm_val, x):
                dp[to_key] = op(dp.get(to_key, e), to_val)

    return dp


def f(k, v, ix):
    b, lt = k     # (1の個数, 未満か)
    cnt, tot = v  # (個数, 総和)

    e, x = ix
    ntot = tot + cnt * pow(2, e, MOD)
    if lt:
        yield k, v
        yield (b+1, lt), (cnt, ntot)  # 1 を立てる
    elif x == 0:
        yield k, v
    elif x == 1:
        yield (b, True), v  # 0 にする
        yield (b+1, False), (cnt, ntot)
    else:
        assert False


def op(a, b):
    a1, a2 = a
    b1, b2 = b
    return (a1+b1) % MOD, (a2+b2) % MOD


def digit_dp(n: int) -> int:
    digits = [int(c) for c in bin(n)[2:]]

    init = {(0, False): (1, 0)}
    nd = len(digits)
    xs = [(e, d) for e, d in zip(reversed(range(nd)), digits)]
    dp = accum_dp(xs, f, op, (0, 0), init)
    res = 0
    for i in range(1, 64):
        a = dp.get((i, True), (0, 0))
        b = dp.get((i, False), (0, 0))
        res += (a[1] + b[1]) * i
        res %= MOD

    return res

MOD = 10**9 + 7
N = int(input())
ans = digit_dp(N)
print(ans)