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;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

map<ll, ll> m;
ll f(ll p) {
    if (p == 0) return 1;
    else if (p == 1) return 2;
    else if (m[p] != 0) return m[p];
    else return m[p] = (f(p/2) + f((p-1)/2) + f((p-2)/2)) % mod;
}


int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N; cin >> N;
    cout << f(N) << endl;

    return 0;
}
