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;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

template < typename T >
void vprint(T &v){
	REP(i, v.size()){
		cout << v[i] << " ";
	}
	cout << endl;
}

map<pll, ll> mp;

ll func(ll X, ll Y){
	if(X==0) return 1;
	pll key = make_pair(X, Y);
	if (mp.find(key)!=mp.end()) return mp[key];
	ll res = 0;

	res += func(X/2, Y/2);
	res %= mod;

	if(X>0 && Y>0){
		res += func((X-1)/2, (Y-1)/2);
		res %= mod;
	}

	if(X>1){
		res += func((X-2)/2, Y/2);
		res %= mod;
	}

	mp[key] = res;
	return res;
}

int main(){

	ll N;
	cin >> N;

	cout << func(N, N) << endl;

    return 0;
}