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
d1 = {0: 1}
d2 = {0: 1, 1: 2}
def f(k):
    if k in d1:return d1[k]
    d1[k] = f(k/2) + (k%2<1 and f(k/2-1))
    return d1[k]
def s(k):
    if k in d2:return d2[k]
    d2[k] = (f(k) + s(k-1) if k%2 else s(k/2) + 2*s(k/2-1)) % MOD
    return d2[k]
print s(input())