#include<bits/stdc++.h>
#include "jumps.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
// void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e5+5;
const ll mod = 1e9+7;
bool f = false;
ll a[mx];
stack<ll> sck;
ll lefte[mx],righte[mx];
priority_queue<pi,vector<pi>,greater<pi>> pq;
bool vis[mx];
ll dp[mx];
// void deb(){
// priority_queue<pi,vector<pi>,greater<pi>> k2 = pq;
// while(k2.size()){
// cout<<k2.top().ff<<" "<<k2.top().ss<<nli;
// k2.pop();
// }
// return ;
// }
void emptify(){
while(sck.size())
sck.pop();
return;
}
void init(ll aa,vi v){
n = aa;
fip(0,n)
a[i] = v[i],lefte[i] = righte[i] = -1;;
emptify();
fip(0,n){
while(sck.size() && a[i] > a[sck.top()])
sck.pop();
if(sck.size())
lefte[i] = sck.top();
sck.push(i);
}
emptify();
fin(n-1,0){
while(sck.size() && a[i] > a[sck.top()])
sck.pop();
if(sck.size())
righte[i] = sck.top();
sck.push(i);
}
fip(0,aa+2)
vis[i] = 0;
return;
}
ll minimum_jumps(ll b,ll c,ll d,ll e){
ll na;
fip(0,n+2)
dp[i] = 1e9,vis[i] = 0;
fip(b,c+1){
if(lefte[i] != -1){
pq.push({1,lefte[i]});
}
if(righte[i] != -1){
pq.push({1,righte[i]});
}
}
// cout<<nli;
// deb();
// cout<<nli;
while(pq.size()){
auto it = pq.top();
// debug(it);
pq.pop();
if(vis[it.ss])
continue;
vis[it.ss] = 1;
dp[it.ss] = min(dp[it.ss],it.ff);
// debug(dp[it.ss]);
if(lefte[it.ss] != -1){
if(!vis[lefte[it.ss]])
pq.push({dp[it.ss]+1,lefte[it.ss]});
}
if(righte[it.ss] != -1){
if(!vis[righte[it.ss]])
pq.push({dp[it.ss]+1,righte[it.ss]});
}
}
// cerr<<nli;
na = 1e9;
fip(d,e+1)
na = min(na,dp[i]);
if(na == 1e9)
na = -1;
return na;
}
// int main(){
// ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
// ll aa;
// cin>>aa;
// vi bb(aa);
// ll q;
// cin>>q;
// fip(0,aa)
// cin>>bb[i];
// init(aa,bb);
// while(q--){
// ll b,c,d,e;
// cin>>b>>c>>d>>e;
// cout<<minimum_jumps(b,c,d,e)<<nli;
// }
// cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
// return 0;
// }
