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;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;

map<pair<ll,ll>, ll> dp;

ll solve(ll S,ll X){
  if(S<0||X<0) return 0;
  if(dp[make_pair(S,X)]!=0) return dp[make_pair(S,X)];
  if(S==0&&X==0) return 1;
  if(S==1&&X==0) return 1;
  if(S==0&&X==1) return 1;
  if(S==1&&X==1) return 2;
  ll res=solve(S/2,X/2)%MOD;
  if(S>=1&&X>=1) res=(res+solve((S-1)/2,(X-1)/2))%MOD;
  if(S>=2) res=(res+solve((S-2)/2,X/2))%MOD;
  dp[make_pair(S,X)]=res;
  return res;
}

int main(){
  ll N; cin>>N;
  cout<<solve(N,N)<<endl;
  return 0;
}
