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 <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;

template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

map<ll, ll> m;

ll f(ll n){
    if(m[n] != 0) return m[n];
    if(n%2 == 0) {
        return (m[n] = (f(n/2) + 2*f(n/2-1)) % MOD);
    }
    else return (m[n] = (2*f(n/2) + f(n/2-1)) % MOD);
}

int main() {
    ll n;
    cin >> n;
    m[0] = 1;
    m[1] = 2;
    cout << f(n) << "\n";
    return 0;
}
