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;
#define ll int64_t

// 6th binary partition function (OEIS: A007729)

const ll mod=1e9+7;
map<ll,ll> dp;

ll calc(ll N){
	if(dp.count(N)) return dp[N];
	if(N%2==0) (dp[N]+=2ll*calc((N/2)-1)%mod+calc(N/2)%mod)%=mod;
	else (dp[N]+=2ll*calc(N/2)%mod+calc((N/2)-1)%mod)%=mod;
	return dp[N];
}

int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);
	ll n;
	cin>>n;
	dp[0]=1;
	dp[1]=2;
	dp[2]=4;
	cout<<calc(n)<<'\n';
}

