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;
const ll MOD = 1000000007;

#define fr first
#define sc second

ll modpow(ll x,ll k){
	if(k == 0)return 1;
	ll ret = modpow(x,k/2);
	ret *= ret; ret %= MOD;
	if(k%2 == 1){
		ret *= x; ret %= MOD;
	}
	return ret;
}

int main(){
	ll n;
	cin >> n;
	
	ll ret = 0;
	map<ll,ll> dp[2];
	dp[0][0] = 1;
	for(int s = 60 ; s >= 0 ; s --){
		ll z = (1LL<<(s+1))-2;
		dp[1].clear();
		for(auto p: dp[0]){
			dp[1][p.fr] += p.sc;
			dp[1][p.fr+(1LL<<s)] += p.sc;
			dp[1][p.fr+(1LL<<(s+1))] += p.sc;
		}
		dp[0].clear();
		for(auto p: dp[1]){
			if(p.fr > n)continue;
			else if(p.fr+z > n)dp[0].insert(p);
			else ret += p.sc*modpow(3,s);
		}
		ret %= MOD;
		/*cout << "s=" << s << endl;
		cout << "ret=" << ret << endl;
		for(auto p: dp[0]){
			cout << p.fr << " " << p.sc << endl;
		}*/
	}
	cout << ret << endl;
}

