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 ll = long long;
const ll MOD = 1e9 + 7;
ll N, f[64][3];
int main() {
  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  cin >> N;
  f[60][0] = 1;
  for (int i = 59; i >= 0; --i) {
    f[i][2] = (f[i + 1][2] * 3 + f[i + 1][1]) % MOD;
    f[i][0] = f[i + 1][0];
    f[i][1] = f[i + 1][1];
    if ((N >> i) & 1) {
      (f[i][2] += f[i + 1][1]) %= MOD;
      (f[i][1] += f[i + 1][0]) %= MOD;
    } else {
      (f[i][0] += f[i + 1][1]) %= MOD;
    }
  }
  cout << (f[0][0] + f[0][1] + f[0][2]) % MOD;
  return 0;
}