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 <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

using namespace std;

long long P = 1000000007;
long long n;
map<long long, long long> memo;

long long f(long long x) {
  if (memo.find(x) != memo.end())
    return memo[x];
  long long ret = 0;
  ret = (ret + f(x / 2)) % P;
  ret = (ret + f((x - 1) / 2)) % P;
  ret = (ret + f(x / 2 - 1)) % P;
  return memo[x] = ret;
}

int main() {
  memo[0] = 1;
  memo[1] = 2;
  cin >> n;
  cout << f(n) << endl;
  return 0;
}
