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;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

ll dp[61][3];
const int mod=1000000007;
int main(){
    ll n;
    cin>>n;
    dp[60][0]=1;
    for(int i=59;i>=0;--i)rep(j,3)rep(k,3){
        ll v=+((n>>i)&1)-j+(k<<1);
        if(v>2) v=2;
        if(v>=0){
            dp[i][v]+=dp[i+1][k];
            dp[i][v]%=mod;
        }
    }
    ll ans=0;
    rep(i,3) ans+=dp[0][i];
    cout<<ans%mod<<endl;
    return 0;
}