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 <iostream>
#include <map>
using namespace std;

using ll = long long;

class modll
{
private:
	static const long long MOD;
public:
	long long value = 0;
	modll() {}
	modll(long long value) : value(value) {}
	modll operator+(const modll& rhs)
	{
		value = (value + rhs.value) % MOD;
		return *this;
	}
	operator long long() const
	{
		return value;
	}
};
const long long modll::MOD = 1e9 + 7;

modll solve(ll n)
{
	static map<ll, modll> m = { {0, 1}, {1, 2} };
	auto& memo = m[n];
	if (memo > 0)
		return memo;
	else
		return memo =
			  solve(n / 2)
			+ solve((n - 1) / 2)
			+ solve((n - 2) / 2);
}

int main() {
	ll N;
	cin >> N;
	cout << solve(N) << endl;
	return 0;
}