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;
map<long long,long long>dp;
const long long md=1e9+7;
long long calc(long long x)
{
	if(dp.find(x)!=dp.end())return dp[x];
	if(x==0)return dp[0]=1;
	if(x==1)return dp[1]=2;
	return dp[x]=(calc(x/2)+calc((x-1)/2)+calc((x-2)/2))%md;
}
int main()
{
	long long n;
	scanf("%lld",&n);
	printf("%lld\n",calc(n));
	return 0;
}