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 <iostream>
#include <map>
using namespace std;

long long N;
int mod = 1e9 + 7;
map<long long, int> mp;

int sum(long long n) {
    auto itr = mp.find(n);
    if (itr != mp.end()) return (*itr).second;
    
    if (n % 2) {
        return mp[n] = (2ll * sum(n / 2) + sum(n / 2 - 1)) % mod;
    } else {
        return mp[n] = (2ll * sum(n / 2 - 1) + sum(n / 2)) % mod;
    }
}

int main() {
    mp[0] = 1; mp[1] = 2;
    cin >> N;
    cout << sum(N) << endl;
}