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 int LL;
const int MOD = 1e9+7;

map<pair<LL, LL>, LL> memo;

LL func(LL S, LL X) {
	if (S < 0 || X < 0) return 0;
	if (S == 0) return 1;
	if (S == 1) return (X > 0) * 2;
	if (memo.find(make_pair(S, X)) != memo.end()) return memo[make_pair(S, X)];
	return memo[make_pair(S, X)] = (func(S/2, X/2) + func((S-1)/2, (X-1)/2) + func((S-2)/2, X/2)) % MOD;
}

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

	LL N;
	cin >> N;
	cout << func(N, N) << endl;

	return 0;
}
