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 <math.h>
#include <bitset>
#define MOD 1000000007
typedef long long ll;
using namespace std;

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

  bitset<61> bit(n);
  ll dp[62][3];
  for(int i=0;i<=61;i++) for(int j=0;j<3;j++) dp[i][j]=0;
  dp[61][0]=1;

  for(int i=60;i>=0;i--){
    if(bit[i]){
      dp[i][0]=dp[i+1][0];
      dp[i][1]=(dp[i+1][0]+dp[i+1][1])%MOD;
      dp[i][2]=(2*dp[i+1][1]+3*dp[i+1][2])%MOD;
    }else{
      dp[i][0]=(dp[i+1][0]+dp[i+1][1])%MOD;
      dp[i][1]=dp[i+1][1];
      dp[i][2]=(dp[i+1][1]+3*dp[i+1][2])%MOD;
    }
  }

  cout<<((dp[0][0]+dp[0][1])%MOD+dp[0][2])%MOD<<endl;
  return 0;
}
