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 <iostream>
#include <unordered_map>

const unsigned long long mod = 1000000007;
std::unordered_map<unsigned long long, unsigned long long> map;

unsigned long long solve(unsigned long long max) {
  auto p = map.find(max);
  if (p != map.end()) { return p->second; }
  if (max == 0) { return 1; }
  if (max == 1) { return 2; }
  auto ret = solve(max / 2) + solve((max - 1) / 2) + solve((max - 2) / 2);
  ret %= mod;
  map.insert(std::make_pair(max, ret));
  return ret;
}

int main() {
  unsigned long long N;
  std::cin >> N;
  std::cout << solve(N) << std::endl;
  return 0;
}