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
MOD = 10 ** 9 + 7

N = int(input())

binN = list(map(int, bin(N)[2:]))
dp = [[0] * 3 for _ in range(len(binN) + 1)]
dp[0][0] = 1
for i, Ni in enumerate(binN):
    dp[i + 1][0] += dp[i][0] * 1
    dp[i + 1][1] += dp[i][0] * Ni
    dp[i + 1][0] += dp[i][1] * (1 - Ni)
    dp[i + 1][1] += dp[i][1] * 1
    dp[i + 1][2] += dp[i][1] * (1 + Ni)
    dp[i + 1][2] += dp[i][2] * 3
    dp[i + 1][0] %= MOD
    dp[i + 1][1] %= MOD
    dp[i + 1][2] %= MOD

print(sum(dp[-1]) % MOD)
