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;
ll dp[32][3];
const ll mod=1e9+7;
int main(){
	ll n;	cin>>n;
	int N=0;
	while(n>>N)	N++;
	dp[N][0]=1;
	for(int i=N;i>0;i--){
		//j=0,1
		for(int j=0;j<3;j++){
			for(int k=0;k<3;k++){
				//N-side:k<=j*2+(N)<=2+k
				int t=j*2+((n>>(i-1))&1);
				if(t>=k)	(dp[i-1][min(2,t-k)]+=dp[i][j])%=mod;
			}
		}
	}
	ll ans=0;
	for(int i=0;i<3;i++)	(ans+=dp[0][i])%=mod;
	cout<<ans<<endl;
	return 0;
}
