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 = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
typedef pair<ll, ll> P;
map<P, ll> dp;
ll f(ll X, ll Y) {
	if (dp.find(P(X, Y)) != dp.end()) return dp[P(X, Y)];
	if (X == 0 && Y == 0) return 1;
	ll sum = f(X / 2, Y / 2);
	if (X >= 1 && Y >= 1) (sum += f((X - 1) / 2, (Y - 1) / 2)) %= MOD;
	if (X >= 1 && Y >= 2) (sum += f((X - 1) / 2, (Y - 2) / 2)) %= MOD;
	return dp[P(X, Y)] = sum;
}
int main() {
	ll N;
	cin >> N;
	cout << f(N, N) << endl;
}
