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 mod 1000000007
using namespace std;

struct lpl{
	long long xr, sm;
	inline bool operator < (const lpl &A)const{return (xr == A.xr) ? (sm < A.sm) : (xr < A.xr);}
};
map<lpl, int> mp;
long long n;

inline int dp(long long u, long long v){
	if(v < 0) return 0; if(!v) return 1;
	if(mp.count((lpl){u, v})) return mp[(lpl){u, v}];
	int ret = 0;
	ret += dp((u >> 1), (v >> 1)); ret = (ret >= mod) ? (ret - mod) : ret; 
	ret += dp(((u - 1) >> 1), ((v - 1) >> 1)); ret = (ret >= mod) ? (ret - mod) : ret; 
	if(v >= 2) ret += dp((u >> 1), ((v - 2) >> 1)); ret = (ret >= mod) ? (ret - mod) : ret; 
	mp[(lpl){u, v}] = ret; return ret;
}

int main()
{
	cin >> n;
	cout << dp(n, n);
	return 0;
} 