//Mrcat template
#include <bits/stdc++.h>
//#include <bits/extc++.h>
using namespace std;
//using namespace __gnu_pbds;
typedef int64_t ll;
typedef string str;
typedef double dbl;
typedef char boolean;
//typedef size_t sz;
#define MOD 1000000000
#define println(n) cout << n << endl
#define print(n) cout << n << ' '
#define input(n) cin >> n;
#define vll vector<ll>
#define vc vector<char>
#define vstr vector<str>
#define vdbl vector<dbl>
#define vbln vector<boolean>
#define vpll vector<pair<ll, ll>>
#define vplb vector<pair<ll, boolean>>
#define vvl vector<vector<ll>>
//#define sum(v) accumulate(all(v), 0LL)
#define all(a) a.begin(), a.end()
#define mll map<ll, ll>
#define mcl map<char, ll>
#define mlb map<ll, boolean>
#define mcb map<char, bool>
#define mstrl map<str, ll>
#define mlstr map<ll, str>
#define sll set<ll>
#define sc set<char>
#define sstr set<str>
#define sdbl set<dbl>
#define sbln set<boolean>
#define msll multiset<ll>
#define msc multiset<char>
#define msstr multiset<str>
#define msdbl multiset<dbl>
#define msbln multiset<boolean>
#define pll pair<ll, ll>
//#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define hurryupmrcat ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
for (T& x : v) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
for (T x : v) os << x << ' ';
return os;
}
template<typename T>
ostream& operator<<(ostream& os, set<T>& st) {
for (T x : st) os << x << ' ';
return os;
}
template<typename T>
ostream& operator<<(ostream& os, multiset<T>& mst) {
for (T x : mst) os << x << ' ';
return os;
}
vll stov(str s) {
vll v;
for (char c : s) {
v.emplace_back(c - '0');
}
return v;
}
const ll MAX = 2e5 + 5;
struct BIT {
ll n;
vll ft;
BIT(ll N) {
n = N + 10;
ft.assign(n + 5, 0);
}
void add(ll idx, ll val) {
for (idx; idx <= n; idx += (idx & (-idx))) {
ft[idx] += val;
}
}
ll get(ll idx) {
ll ret = 0;
for (idx; idx >= 0; idx -= (idx & (-idx))) {
ret += ft[idx];
}
return ret;
}
};
bool Comp(pll p1, pll p2) {
if (p1.second < p2.second) return false;
return true;
}
const ll MAX_SZ = 2e5 + 10;
ll suf[MAX_SZ];
struct Cor {
ll x, y;
};
ll n;
ll l[1005];
ll dist[1005][5005];
ll Bfs(ll str_x, ll str_y, ll fin_x, ll fin_y) {
for (ll i = 0; i <= n; ++i) {
for (ll j = 0; j <= 5004; ++j) {
dist[i][j] = -1;
}
}
queue<Cor> q;
q.push({str_x, str_y});
dist[str_x][str_y] = 0;
while (!q.empty()) {
Cor cur = q.front();
q.pop();
if (cur.x == fin_x && cur.y == fin_y) {
return dist[cur.x][cur.y];
}
ll d = dist[cur.x][cur.y];
vector<Cor> v;
if (cur.y > 1) {
v.push_back({cur.x, cur.y - 1});
} else if (cur.x > 1) {
v.push_back({cur.x - 1, l[cur.x - 1] + 1});
}
if (cur.y < l[cur.x] + 1) {
v.push_back({cur.x, cur.y + 1});
} else if (cur.x < n) {
v.push_back({cur.x + 1, 1});
}
if (cur.x > 1) {
v.push_back({cur.x - 1, min(cur.y, l[cur.x - 1] + 1)});
}
if (cur.x < n) {
v.push_back({cur.x + 1, min(cur.y, l[cur.x + 1] + 1)});
}
for (Cor& nx : v) {
if (dist[nx.x][nx.y] == -1) {
dist[nx.x][nx.y] = d + 1;
q.push(nx);
}
}
}
return -1;
}
void solve() {
cin >> n;
ll s_x, s_y, e_x, e_y;
cin >> s_x >> s_y >> e_x >> e_y;
for (ll i = 1; i <= n; ++i) {
cin >> l[i];
}
cout << (Bfs(s_x, s_y, e_x, e_y)) << endl;
}
int main(int argc, char const *argv[]) {
hurryupmrcat
ll t = 1;
//cin >> t;
for (size_t cs = 1; cs <= t; ++cs) {
solve();
}
return 0;
}
