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 std::cin;
using std::cout;
using std::pair;
using std::vector;
const int Maxn = 1e5 + 1, mod = 1e9 + 7;
std::map < long long, int > mp;
int dp( long long x )
{
 if( mp[ x ] != 0 )
  return mp[ x ];
 return mp[ x ] = ( ( dp( x / 2 ) + dp( ( x - 1 ) / 2 ) ) % mod + dp( ( x - 2 ) / 2 ) ) % mod;
}
long long n;
int main( )
{
 std::ios::sync_with_stdio( false );
 cin.tie( NULL );
 cout.tie( NULL );
 cin >> n;
 mp[ 0 ] = 1;
 mp[ 1 ] = 2;
 printf( "%d", dp( n ) ); 
 return 0;
}