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;
typedef pair<LL, LL> P;
const LL MOD = 1000000007LL;
map<P, LL> memo;
LL f(LL S,LL X) {
	if (S == 0) return 1;
	if (memo.find(P(S, X)) != memo.end()) return memo[P(S, X)];
	LL ret = f(S / 2, X / 2);
	if (S >= 1 && X >= 1) ret += f((S - 1) / 2, (X - 1) / 2);
	if (S >= 2) ret += f((S - 2) / 2, X / 2);
	return memo[P(S, X)] = ret%MOD;
}
int main() {
	LL N;
	cin >> N;
	cout << f(N, N) << endl;
}