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<map>
using namespace std;
long long n;
map<long long, long long>M;
long long solve_1(long long W) {
	if (M[W] >= 1)return M[W];
	if (W == 0)return 0;
	if (W == 1)return 1;
	if (W % 2 == 0) {
		long long a1 = solve_1(W / 2);
		M[W] = a1;
		return a1;
	}
	if (W % 2 == 1) {
		long long a1 = solve_1(W / 2) + solve_1(W / 2 + 1);
		M[W] = a1;
		return a1;
	}
}
long long solve(long long W) {
	if (W == 0)return 0;
	if (W == 1)return 1;
	if (W % 2 == 0) { return (3 * solve(W / 2) - solve_1(W / 2) + 1000000007) % 1000000007; }
	if (W % 2 == 1) { return (3 * solve(W / 2) + solve_1(W / 2 + 1) + 1000000007) % 1000000007; }
}
int main() {
	cin >> n;
	cout << solve(n + 1) << endl;
	return 0;
}