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
#include <bits/stdc++.h>
using namespace std;
const int Mo=1000000007;
map <long long,int> f;
inline int solve(long long n) {
    if(f.count(n)) return f[n];
    return f[n]=((solve(n/2)+solve((n-1)/2))%Mo+solve((n-2)/2))%Mo;
}
int main() {
    f[0]=1,f[1]=2;
    long long n;
    cin>>n;
    cout<<solve(n);
    return 0;
}