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<algorithm>
#include<map>
#define MOD 1000000007
using namespace std;
map<long long,long long> ma;
long long n;
long long DP(long long x)
{
	if(ma[x]) return ma[x];
	ma[x]=(DP(x/2)+DP((x-1)/2)+DP((x-2)/2))%MOD;
	return ma[x];
}
int main()
{
	for(int i=0;i<=10;i++)
	{
		long long re=0;
		for(int u=0;u<=i;u++)
			for(int v=0;v<=i;v++)
			{
				for(int j=0;j<=v;j++)
					if((j^(v-j))==u)
					{
						re++;
						break;
					}
			}
		ma[i]=re;
	}
	scanf("%lld",&n);
	printf("%lld",DP(n));
}