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 long long ll;

const ll MOD = 1000000007;

//ll dp[64][10010];
ll dp[64][3];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n;
	cin >> n;
	int cnt = 0;
	for (;(1LL << cnt) <= n;) cnt++;
	dp[0][0] = 1;
	for (int i = 1; i <= cnt; i++) {
		if ((1LL << (cnt - i)) & n) {
			dp[i][0] = dp[i - 1][0];
			dp[i][1] = (dp[i - 1][0] + dp[i - 1][1]) % MOD;
			dp[i][2] = (dp[i - 1][1] * 2 + dp[i - 1][2] * 3) % MOD;
		} else {
			dp[i][0] = (dp[i - 1][0] + dp[i - 1][1]) % MOD;
			dp[i][1] = dp[i - 1][1];
			dp[i][2] = (dp[i - 1][1] + dp[i - 1][2] * 3) % MOD;
		}
	}
	ll ans = 0;
	for (int i = 0; i <= 2; i++) (ans += dp[cnt][i]) %= MOD;
	cout << ans << endl;
	return 0;
}
