p03849 AtCoder Regular Contest 066 - Xor Sum
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
```python
n=int(input())
d=dict()
def get(n):
    if(n==1):return 1
    if(n==0):return 0
    if(n in d.keys()):return d[n]
    if(n%2==0):
        d[n]=2*get(n//2)+get(n//2-1)
    else:
        d[n]=2*get(n//2)+get(n//2+1)
    d[n]%=(10**9+7)
    return d[n]
def check(u,v,n):
    for a in range(n+1):
        b=u ^ a
        if(a+b==v):
            return 1
    return 0
#for e in range(1,n):
#    ans=0
#    for i in range(e+1):
##        for j in range(e+1):
#            ans+=check(i,j,e)
#    print(ans,get(e+1))
print(get(n+1))

```