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<iostream>
#include<map>
#define ll long long
#define mo 1000000007
using namespace std;
ll n;
map<ll,ll>a;
ll work(ll n)
{
	if(!n)return 1;
	if(n==1)return 2;
	if(a[n])return a[n];
	return a[n]=(work(n>>1)+work((n-1)>>1)+work((n-2)>>1))%mo;
}
int main()
{
	cin>>n;
	cout<<work(n)<<endl;
}