import sys
from functools import lru_cache

MOD = 10**9 + 7

def main():
    N = int(sys.stdin.readline())
    bits = list(map(int, bin(N)[2:]))  # Convert N to binary, then to a list of digits
    m = len(bits)
    total = 0

    for k in range(1, m + 1):
        # Calculate sum of numbers with exactly k ones in binary
        sum_k = 0
        cnt_k = 0

        @lru_cache(maxsize=None)
        def dp(pos, count, tight):
            nonlocal bits, k, m
            rem = m - pos
            required = k - count
            if required < 0 or required > rem:
                return (0, 0)
            if pos == m:
                return (0, 1) if required == 0 else (0, 0)
            max_bit = bits[pos] if tight else 1
            res_sum = 0
            res_cnt = 0
            for bit in range(0, max_bit + 1):
                new_tight = tight and (bit == max_bit)
                new_count = count + (bit == 1)
                s, c = dp(pos + 1, new_count, new_tight)
                w = pow(2, (m - 1 - pos), MOD)
                contrib = (bit * w) % MOD
                contrib = (contrib * c) % MOD
                res_sum = (res_sum + s + contrib) % MOD
                res_cnt = (res_cnt + c) % MOD
            return (res_sum % MOD, res_cnt % MOD)

        s, c = dp(0, 0, True)
        sum_k = s % MOD
        total = (total + sum_k * k) % MOD

    print(total % MOD)

if __name__ == '__main__':
    main()