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

long long dp[100][4];
long long const MOD = 1000000007;

long long mod_p(long long x, long long y) {
	return (x + y) % MOD;
}
long long mod_m(long long x, long long y) {
	return (x*y) % MOD;
}

int main() {
	long long x;
	cin >> x;
	int t = 0;
	while ((x >> t) > 0) {
		t++;
	}
	dp[1][0] = dp[1][1] = 1;
	dp[1][2] = 0;
	for (int i = 1; i < t; i++) {
		if (((x >> (t - i - 1)) & 1) == 0) {
			dp[i + 1][0] = mod_p(dp[i][0],dp[i][1]);
			dp[i + 1][1] = dp[i][1];
			dp[i + 1][2] = mod_p(dp[i][1], 3*dp[i][2]);
		}
		else {
			dp[i + 1][0] = dp[i][0];
			dp[i + 1][1] = mod_p(dp[i][0], dp[i][1]);
			dp[i + 1][2] = mod_p(2 * dp[i][1], 3*dp[i][2]);
		}
	}
	cout << (dp[t][0] + dp[t][1] + dp[t][2]) % MOD << endl;

}