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 <cstdio>
#include <map>
using namespace std;

typedef long long ll;
ll n, M = 1e9 + 7;
map<ll, ll> d;
ll f(ll p) {
	if (p == 0) return 1;
	if (p == 1) return 2;
	if (p == 2) return 4;
	if (d[p]) return d[p];
	if (p&1) return d[p] = (2 * f(p / 2) + f(p / 2 - 1)) % M;
	else return d[p] = (f(p / 2) + 2 * f(p / 2 -1)) % M;
}
int main()
{
	cin >> n;
	cout << f(n);
    return 0;
}
