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 FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MOD=1e9+7;
typedef long long ll;
typedef pair<ll,ll> P;

const ll MAX_N=1e18;

ll N;

//ll memo[1000][1000];
map<P,ll> memo;

ll dfs(ll s,ll t){
	if (s==0 && t==0){
		return 1;
	}
	if (s<0 || t<0){
		return 0;
	}
	if (memo.find(P(s,t))!=memo.end()){
		return memo[P(s,t)];
	}
	ll res=dfs(s/2,t/2);
	if (s>=1 && t>=1){
		res+=dfs((s-1)/2,(t-1)/2);
		res%=MOD;
	}
	if (s>=2){
		res+=dfs((s-2)/2,t/2);
		res%=MOD;
	}
	return 	memo[P(s,t)]=res;
}

int main(){
//	memset(memo,-1,sizeof(memo));
	scanf("%lld",&N);
	printf("%lld\n",dfs(N,N));
	return 0;
}