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 <cstdio>
#include <map>
const int mod=1e9+7;
using namespace std;
map<long long,int> ma;
int Cl(long long x){
	if(ma[x])
		return ma[x];
	if(x&1)
		return ma[x]=((long long)Cl(x/2ll)*2ll+Cl(x/2ll-1ll))%mod;
	return (Cl(x/2ll-1ll)*2ll+Cl(x/2ll))%mod;
}
int main(){
	long long n;
	scanf("%lld",&n);
	ma[0]=1;
	ma[1]=2;
	ma[2]=4;
	ma[3]=5;
	ma[4]=8;
	printf("%d",Cl(n));
	return 0;
}