#include <bits/stdc++.h>
using namespace std;
#define int long long
template<class A, class B>
bool chmin(A &a, const B &b) {
return a > b ? (a = b) == b : false;
} template<class A, class B>
bool chmax(A &a, const B &b) {
return a < b ? (a = b) == b : false;
}
const int inf = 1e18;
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n; cin >> n;
int sl, sc; cin >> sl >> sc;
int el, ec; cin >> el >> ec;
int l[n + 1];
for (int i = 1; i <= n; ++i) {
cin >> l[i];
l[i]++;
}
if (sl > el) {
swap(sl, el);
swap(sc, ec);
}
vector<vector<int>> dp(n + 1, vector<int> (3, inf));
vector<int> p(n + 1);
dp[sl][0] = sc - 1;
dp[sl][1] = l[sl] - sc;
dp[sl][2] = 0; p[sl] = sc;
if (sl + 1 <= n) chmin(dp[sl][0], dp[sl][1] + 2);
if (sl - 1 >= 1 && p[sl] >= l[sl - 1]) chmin(dp[sl][0], dp[sl][2] + 2);
else if (sl - 1 >= 1) chmin(dp[sl][0], dp[sl][2] + l[sl - 1] - p[sl] + 2);
if (sl + 1 <= n) chmin(dp[sl][1], dp[sl][0] + 2);
if (sl - 1 >= 1 && l[sl - 1] >= l[sl]) chmin(dp[sl][1], dp[sl][0] + 2);
else if (sl - 1 >= 1) chmin(dp[sl][1], dp[sl][0] + 2 + l[sl] - l[sl - 1]);
for (int i = sl + 1; i <= el; ++i) {
dp[i][0] = min(dp[i - 1][0] + 1, dp[i - 1][1] + l[i - 1]);
if (p[i - 1] >= l[i]) chmin(dp[i][0], dp[i - 1][2] + l[i]);
else chmin(dp[i][0], dp[i - 1][2] + p[i - 1]);
dp[i][1] = dp[i - 1][0] + 1;
if (l[i - 1] >= l[i]) chmin(dp[i][1], dp[i - 1][1] + 1);
else chmin(dp[i][1], dp[i - 1][1] + l[i] - l[i - 1]);
if (p[i - 1] >= l[i]) chmin(dp[i][1], dp[i - 1][2] + 1);
else chmin(dp[i][1], dp[i - 1][2] + l[i] - p[i - 1]);
dp[i][2] = dp[i - 1][0] + 1; p[i] = 1;
if (l[i - 1] >= l[i]) if (chmin(dp[i][2], dp[i - 1][1] + 1)) p[i] = l[i];
else if (chmin(dp[i][2], dp[i - 1][1] + 1)) p[i] = l[i - 1];
if (p[i - 1] >= l[i]) if (chmin(dp[i][2], dp[i - 1][2] + 1)) p[i] = l[i];
else if (chmin(dp[i][2], dp[i - 1][2] + 1)) p[i] = p[i - 1];
if (chmin(dp[i][2], dp[i][0])) p[i] = 1;
if (chmin(dp[i][2], dp[i][1])) p[i] = l[i];
chmin(dp[i][0], dp[i][2] + p[i] - 1);
chmin(dp[i][1], dp[i][2] + l[i] - p[i]);
if (i + 1 <= n) chmin(dp[i][0], dp[i][1] + 2);
if (i - 1 >= 1 && p[i] >= l[i - 1]) chmin(dp[i][0], dp[i][2] + 2);
else if (i - 1 >= 1) chmin(dp[i][0], dp[i][2] + l[i - 1] - p[i] + 2);
if (i + 1 <= n) chmin(dp[i][1], dp[i][0] + 2);
if (i - 1 >= 1 && l[i - 1] >= l[i]) chmin(dp[i][1], dp[i][0] + 2);
else if (i - 1 >= 1) chmin(dp[i][1], dp[i][0] + 2 + l[i] - l[i - 1]);
}
int res = min({dp[el][0] + ec - 1, dp[el][1] + l[el] - ec, dp[el][2] + abs(p[el] - ec)});
if (el - 1 >= 1) chmin(res, dp[el][0] + 1 + abs(l[el - 1] - ec));
cout << res;
}
