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 <unordered_map>
#include <string>
#include <map>
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007LL;
map<pair<ll,ll>, ll> um;

ll func(ll s, ll x){
  	//cout << s << ":" << x << endl;
  	if(s==0) return 1;
    //ch(s,x);
    if(um.find(make_pair(s,x))!=um.end()) return um[make_pair(s,x)];
    ll ret=0;
        ret += func(s/2, x/2);
        if(s>0&&x>0)ret += func( (s-1) / 2,(x - 1) / 2); 
  		ret %= MOD;
        if(s>1)ret += func( (s-2) / 2, x/2);
    um[make_pair(s,x)] = ret % MOD;
    return (ret % MOD);
}

int main(){
    ll n;
    cin >> n;
    cout << func(n,n) << endl;
    return 0;
}