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
// review
#include <iostream>
#include <map>

using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;

ll n;
map<ll, ll> m;
ll dfs(ll n) {
  if (m[n] != 0) {
    return m[n];
  }
  if (n == 0) {
    return 1;
  }
  if (n == 1) {
    return 2;
  }
  return m[n] = (dfs(n/2) + dfs((n-1)/2) + dfs((n-2)/2)) % MOD;
}

void solve() {
  cout << dfs(n) << endl;
}

int main() {
  cin >> n;
  solve();
}
