#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
int h[MAXN], prevmx[MAXN], nxtmx[MAXN];
int n;
void init(int N, vector<int> H) {
n = N;
copy(H.begin(), H.end(), h);
for (int i = 0; i < n; ++i) {
prevmx[i] = i - 1;
while (prevmx[i] != -1 && h[prevmx[i]] <= h[i]) {
prevmx[i] = prevmx[prevmx[i]];
}
}
for (int i = n - 1; i >= 0; --i) {
nxtmx[i] = i + 1;
while (nxtmx[i] < n && h[nxtmx[i]] <= h[i]) {
nxtmx[i] = nxtmx[nxtmx[i]];
}
}
}
int minimum_jumps(int A, int B, int C, int D) {
int mncnt = n;
auto comp = [&](int i, int j) {
queue<int> q;
vector<bool> visited(n);
q.push(i);
visited[i] = true;
int dist = 0;
while (!q.empty()) {
int sz = q.size();
for (int k = 0; k < sz; ++k) {
int cur = q.front();
q.pop();
if (cur == j) {
return dist;
}
if (prevmx[cur] != -1 && !visited[prevmx[cur]]) {
q.push(prevmx[cur]);
visited[prevmx[cur]] = true;
}
if (nxtmx[i] < n && !visited[nxtmx[cur]]) {
q.push(nxtmx[cur]);
visited[nxtmx[cur]] = true;
}
}
dist++;
}
throw;
};
for (int i = B; i >= A; --i) {
for (int j = C; j <= D; ++j) {
if (prevmx[j] < i) {
mncnt = min(mncnt, comp(i, j));
}
}
}
return mncnt == n ? -1 : mncnt;
}
//int main() {
// init(7, {6, 1, 2, 3, 4, 5, 7});
// cout << minimum_jumps(1, 1, 6, 6) << '\n';
//// cout << minimum_jumps(1, 3, 5, 6) << '\n';
//// cout << minimum_jumps(0, 1, 2, 2) << '\n';
//// return 0;
//}
