#include <bits/stdc++.h>
using namespace std;
#define int long long
int L[200001];
int arr[200001];
int rarr[200001];
int lift[200001][18];
int n;
void init(int32_t N, vector<int32_t> H) {
n=N;
for(int i=0;i<N;i++)arr[i]=H[i];
for(int i=0;i<N;i++)rarr[arr[i]]=i;
stack<int> q;
for(int i=0;i<N;i++){
while(!q.empty() and q.top()<arr[i])q.pop();
if(!q.empty())L[arr[i]]=q.top();
else L[arr[i]]=n;
q.emplace(arr[i]);
}
while(!q.empty())q.pop();
for(int i=N-1;i>=0;i--){
while(!q.empty() and q.top()<arr[i])q.pop();
if(!q.empty())lift[arr[i]][0]=q.top();
else lift[arr[i]][0]=n;
q.emplace(arr[i]);
}
for(int i=1;i<=N;i++)if(L[i]>lift[i][0])swap(L[i],lift[i][0]);
for(int bit=1;bit<=17;bit++){
for(int i=1;i<=N;i++){
lift[i][bit] = lift[lift[i][bit-1]][bit-1];
}
}
}
int32_t minimum_jumps(int32_t A, int32_t B, int32_t C, int32_t D) {
int base = arr[A];
int tar = arr[C];
int ans = 0;
for(int jump=17;jump>=0;jump--){
if(lift[base][jump]<tar) { base = lift[base][jump]; ans|=(1<<jump); }
}
if(L[base]==tar or lift[base][0]==tar)return ans+1;
return -1;
}
//int32_t main() {
// int32_t N, Q;
// assert(2 == scanf("%d %d", &N, &Q));
// std::vector<int32_t> H(N);
// for (int32_t i = 0; i < N; ++i) {
// assert(1 == scanf("%d", &H[i]));
// }
// init(N, H);
//
// for (int32_t i = 0; i < Q; ++i) {
// int32_t A, B, C, D;
// assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
// printf("%d\n", minimum_jumps(A, B, C, D));
// }
// return 0;
//}
