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;
using ll=long long;

ll MAX_N=1e18+7;
ll mod=1e9+7;
ll dp[61][3];

int main(){
	ll N;
	cin>>N;
	dp[60][0]=1;
	for(ll a=59;a>=0;--a){
		for(ll b=0;b<=2;++b){
			for(ll c=0;c<=2;++c){
				ll d=b*2+(N>>a&1)-c;
				if(d<0)continue;
				if(d>2)d=2;
				dp[a][d]+=dp[a+1][b];
				dp[a][d]%=mod;
			}
		}
	}
	ll ret=0;
	for(ll i=0;i<=2;++i)ret+=dp[0][i];ret%=mod;
	cout<<ret<<endl;
	return 0;
}
