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>
#define LL long long
#define MOD (1000000007)
using namespace std;

LL n;
map<pair<LL,LL>,int>f;

int DFS(LL u,LL v)
{
	if (!v) return 1;
	if (f[make_pair(u,v)]) return f[make_pair(u,v)];
	int ans=0;
	(ans+=DFS(u>>1,v>>1))%=MOD;
	(ans+=DFS((u-1)>>1,(v-1)>>1))%=MOD;
	if (v>=2) (ans+=DFS(u>>1,(v-2)>>1))%=MOD;
	return f[make_pair(u,v)]=ans;
}

int main()
{
	cin>>n;
	cout<<DFS(n,n)<<endl;
}