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;
typedef pair<ll, ll> P;

const ll mod = 1e9 + 7;
map<P, ll> mp;

ll f(ll s, ll x) {
  if (mp[P(s, x)] > 0) return mp[P(s, x)];
  if (s == 0) return mp[P(s, x)] = 1LL;
  
  ll res = f(s / 2, x / 2);
  if (s - 1 >= 0 && x - 1 >= 0) res += f((s - 1) / 2, (x - 1) / 2);
  if (s - 2 >= 0) res += f((s - 2) / 2, x / 2);
  return mp[P(s, x)] = res % mod;
}

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