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;
using lint = long long;
using VI = vector<int>;
using VVI = vector<VI>;
const lint MOD = 1e9 + 7;

map<lint, lint> memo;
lint rec(lint n) {
  if (memo.count(n)) return memo[n];
  lint res = 0;
  if (n % 2) {
    res = 2 * rec(n / 2) + rec(n / 2 - 1);
  } else {
    res = rec(n / 2) + 2 * rec(n / 2 - 1);
  }
  return memo[n] = res % MOD;
}

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  lint n; cin >> n;
  memo[-1] = 0;
  memo[0] = 1;
  cout << rec(n) << '\n';
  return 0;
}