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 <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#define MOD 1000000007
#define mkp make_pair
typedef long long ll;
using namespace std;

ll dp[61][3];

void add(ll &a,ll b){
    a=(a+b)%MOD;
}

int main(){
  ll N;
  cin>>N;

  dp[60][0]=1;
  for(int i=59;i>=0;i--){
      for(int j=0;j<=2;j++){
          int n=0;
          if(N&(1ll<<i)) n=1;
          for(int k=0;k<=2;k++){
              int ns=2*j+n-k;
              if(ns<0) continue;
              if(ns>2) ns=2;
              add(dp[i][ns],dp[i+1][j]);
          }
      }
  }


  ll ans=0;
  for(int j=0;j<=2;j++) ans=(ans+dp[0][j])%MOD;
  cout<<ans<<endl;


  return 0;
}
