You are given a positive integer N. Find the number of the pairs of integers u and v (0≦u,v≦N) such that there exist two non-negative integers a and b satisfying a xor b=u and a+b=v. Here, xor denotes the bitwise exclusive OR. Since it can be extremely large, compute the answer modulo 10^9+7.

Constraints

* 1≦N≦10^{18}

Input

The input is given from Standard Input in the following format:


N


Output

Print the number of the possible pairs of integers u and v, modulo 10^9+7.

Examples

Input

3


Output

5


Input

1422


Output

52277


Input

1000000000000000000


Output

787014179
n = int(input())
b = bin(n)[2:]
MOD = 10 ** 9 + 7

dp1, dp2, dp3 = 1, 0, 0

for d in b:
    if d == '1':
        dp1, dp2, dp3 = dp1 % MOD, (dp1 + dp2) % MOD, (dp2 * 2 + dp3 * 3) % MOD
    else:
        dp1, dp2, dp3 = (dp1 + dp2) % MOD, dp2, (dp2 + dp3 * 3) % MOD

print((dp1 + dp2 + dp3) % MOD)
