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 <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
using namespace std;

typedef long long ll;

ll mod = 1e9 + 7;
map<ll, ll> mem;

ll func(ll m) {
	if (m == 1) return 1;
	if (m == 0) return 0;
	if (mem.count(m) != 0) return mem[m];
	if (m % 2 == 1) {
		ll ret = (2 * func(m / 2) + func(m / 2 + 1)) % mod;
		return mem[m] = ret;
	}
	else {
		ll ret = (2 * func(m / 2) + func(m / 2 - 1)) % mod;
		return mem[m] = ret;
	}
}

int main() {
	ll n; cin >> n;
	cout << func(n + 1) << endl;
	return 0;
}