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;
const int MOD = (int)1e9+7;
map<pair<long long, int>, int> M;

int DP(long long N, int k)
{
  if(N<0) return 0;
  if(N>(2LL<<(k+1))-2) N = (2LL<<(k+1))-2;
  if(N == 0) return 1;
  auto it = M.find(make_pair(N, k));
  if(it != M.end()) return it->second;
  long long ans = 0;
  ans += DP(N-(2LL<<k), k-1);
  ans += DP(N-(1LL<<k), k-1);
  ans += DP(N, k-1);
  return M[make_pair(N, k)] = ans % MOD;
}

int solve(long long N)
{
  M.clear();
  return DP(N, 61);
}
int main()
{
  long long N;
  scanf("%lld", &N);
  printf("%d\n", solve(N));
}