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 <cstdio>
#include <cstring>
#include <algorithm>
#include <map>

using namespace std;

typedef long long LL;
const int mod = 1000000007;

map<LL, LL>m1;

LL f(LL n);

int main(){
  LL n;
  m1[1] = 2, m1[2] = 4, m1[3] = 5;
  scanf("%lld", &n);
  printf("%lld\n", f(n));
  return 0;
}
LL f(LL n){
  if(m1[n] != 0) return m1[n];
  LL n1 = n>>1;
  LL n2 = (n-(LL)1)>>1;
  LL n3 = (n-(LL)2)>>1;
  return m1[n] = (f(n1)%mod + f(n2)%mod + f(n3)%mod)%mod;
}
