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
import sys
from collections import Counter
readline = sys.stdin.readline
MOD = 10**9+7
N = int(readline())

CC = Counter()
CC[0] = 1
CC[1] = 2
def calc(x):
    res = 0
    if CC[x]:
        res = CC[x]
    elif x == 1:
        res = 2
    elif x%2 == 0:
        res = 2*calc(x//2-1) + calc(x//2)
    else:
        res = 2*calc(x//2) + calc(x//2-1)
    CC[x] = res%MOD
    return res%MOD
print(calc(N))