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, x):
    state, xlt, ylt = k  # (state, xが未満か, yが未満か)

    for xd, yd in [(0, 0), (0, 1), (1, 0), (1, 1)]:
        if not xlt and xd > x: continue
        if not ylt and yd > x: continue
        n_xlt = xlt | (xd < x)
        n_ylt = ylt | (yd < x)

        if state == 0:  # 未確定
            if xd < yd:
                yield (state+1, n_xlt, n_ylt), v
            elif xd == yd == 0:
                yield (state, n_xlt, n_ylt), v
        elif state == 1:  # x < y かつ (x and y) < (x xor y)
            if xd == yd == 1:
                yield (state+1, n_xlt, n_ylt), v
            else:
                yield (state, n_xlt, n_ylt), v
        elif state == 2:  # 条件を全て満たした状態
            yield (state, n_xlt, n_ylt), v
        else:
            assert False


def op(a, b):
    return (a + b) % MOD


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

    init = {(0, False, False): 1}
    dp = accum_dp(digits, f, op, 0, init)
    res = 0
    for (state, _, _), v in dp.items():
        if state == 2:
            res += v
            res %= MOD

    return res


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