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;

int main() {
	int64_t n, mod = 1e9 + 7;
	cin >> n;
	map<int64_t, int64_t> mp;
	function<int64_t(int64_t)> f = [&](int64_t a) {
		if (a < 0) {
			return int64_t(0);
		}
		if (mp[a]) {
			return mp[a];
		}
		return mp[a] = (f(a / 2) + f((a - 1) / 2) + f(a / 2 - 1)) % mod;
	};
	mp[0] = 1;
	cout << f(n) << endl;
	return 0;
}