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 = ll(1e9 + 7);
ll dp[70][2][2];
int a[70];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll N;
	cin >> N;

	for(int i = 0; i < 64; i++) {
		a[i] = N >> i & 1;
	}

	ll ans = 0;
	dp[0][0][0] = 1;
	for(int i = 0; i < 64; i++) {
		for(int j = 0; j < 2; j++) {
			for(int k = 0; k < 2; k++) {
				if(dp[i][j][k] == 0) continue;
				int u[4] = { 0, 1, 0, 1 }, v[4] = { 0, 0, 1, 1 };
				for(int l = 0; l < 4; l++) {
					if(u[l] == 0 && v[l] == 1) continue;
					int sum = j + u[l] + v[l];
					int nk = (sum % 2) > a[i] || k && (sum % 2) >= a[i];
					int nj = sum / 2;
					dp[i + 1][nj][nk] += dp[i][j][k];
					dp[i + 1][nj][nk] %= MOD;
				}
			}
		}
	}

	cout << dp[64][0][0] << endl;
}