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 double db;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define empb emplace_back
#define all(x) (x).begin(),(x).end()
#define lbd(a, x) lower_bound(all(a), x)
const int mod = 1e9 + 7;
map<ll, ll> mp;
ll solve(ll n) {
	if(n == 0) return 1;
	if(n == 1) return 2;
	if(mp.find(n) != mp.end()) return mp[n];
  if(n & 1) {
    return mp[n] = (2 * solve(n / 2) + solve(n / 2 - 1)) % mod;
  } else {
    return mp[n] = (2 * solve(n / 2 - 1) + solve(n / 2)) % mod;
  }
}
int main() {
#ifdef local
	freopen("in.txt", "r", stdin);
#endif
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	ll n; cin >> n;
	cout << solve(n) << '\n';
	return 0;
}
