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;
typedef long long ll;

map<pair<ll,ll>,ll> memo;
ll f(ll s,ll x){
    pair<ll,ll> P = make_pair(s,x);
    if(memo.count(P))return memo[P];
    if(s<=3 && x<=3){
        ll ans = 0;
        for(int a=0;a<4;a++)for(int b=0;b<4;b++){
            if((a&b)!=b)continue;
            if(a+b<=s && (a^b)<=x)ans++;
        }
        return memo[P] = ans;
    }else{
        ll ans = (f(s/2,x/2)+f((s-1)/2,(x-1)/2)+f((s-2)/2,x/2)) % 1000000007;
        return memo[P] = ans;
    }
}

int main(void){
    ll n;
    cin>>n;
    ll ans = f(n,n);
    cout<<ans<<endl;
    return 0;
}
