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;

const int MOD = 1000000007;
typedef pair<long long, long long> Pairs;

long long n;
map<Pairs, int> dp;

inline void Add(int &x, int a) {
	x += a; while (x >= MOD) x -= MOD;
}
inline int Calc(long long u, long long v) {
	if (v < 0) return 0;
	if (!v) return 1;
	if (dp.count(Pairs(u, v))) return dp[Pairs(u, v)];
	int res = 0;
	Add(res, Calc(u >> 1, v >> 1));
	Add(res, Calc((u - 1) >> 1, (v - 1) >> 1));
	if (v >= 2) Add(res, Calc(u >> 1, (v - 2) >> 1));
	return dp[Pairs(u, v)] = res;
}

int main(void) {
	cin >> n;
	cout << Calc(n, n) << endl;
	return 0;
}