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>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long

using namespace std;

map<LL ,LL> dp;
LL INF=1000000007;

LL func(LL N){
    if(dp.find(N)!=dp.end())return dp[N];
    if(N==0)return dp[0]=1;
    if(N==1)return dp[1]=2;

    return dp[N]=(func(N/2)+func((N-1)/2)+func((N-2)/2))%INF;
}

int main(){
    LL N;cin>>N;
    cout<<func(N)<<endl;
    return 0;
}