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 <map>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

map<P, ll> m;
ll mod = 1e9+7;

ll f(ll S, ll X){
  if(S == 1){
    return 2;
  }
  else if(S == 0){
    return 1;
  }
  else if(m.find(P(S, X)) == m.end()){
    ll res = (f(S/2, X/2) + f((S-1)/2, (X-1)/2) + f((S-2)/2, X/2)) % mod;
    m[P(S, X)] = res;
    return res;
  }
  else{
    ll res = m[P(S, X)];
    return res;
  }
}

int main(){
  ll N;   cin >> N;
  cout << f(N, N) << endl;

  return 0;
}
