#include <bits/stdc++.h>
using namespace std;
int main()
{
long long N;
cin >> N;
long long debx, deby, finx, finy;
cin >> debx >> deby >> finx >> finy;
debx--, deby--, finx--, finy--;
vector<long long> Tab(N);
map<long long, long long> M;
vector<long long> ys;
for (long long i = 0; i < N; i++)
{
cin >> Tab[i];
ys.push_back(Tab[i]);
}
ys.push_back(deby);
ys.push_back(finy);
long long buff = 0;
sort(ys.begin(), ys.end());
vector<long long> ys2;
for (long long i = 0; i < ys.size(); i++)
if (i == 0 || ys[i] != ys[i - 1])
{
M[ys[i]] = buff++;
ys2.push_back(ys[i]);
}
swap(ys, ys2);
deby = M[deby];
finy = M[finy];
for (long long i = 0; i < N; i++)
Tab[i] = M[Tab[i]];
vector<vector<long long>> occ(N, vector<long long>(buff + 1));
priority_queue<vector<long long>> PQ;
PQ.push({0, debx, deby});
while (!PQ.empty())
{
long long x = PQ.top()[1], y = PQ.top()[2], t = PQ.top()[0];
PQ.pop();
if (occ[x][y])
continue;
occ[x][y] = 1;
if (x == finx && y == finy)
{
cout << -t;
return 0;
}
if (y > 0)
PQ.push({t - (ys[y] - ys[y - 1]), x, y - 1});
if (y < Tab[x])
PQ.push({t - (ys[y + 1] - ys[y]), x, y + 1});
if (x > 0 && y == 0)
PQ.push({t - 1, x - 1, Tab[x - 1]});
if (x < N - 1 && y == Tab[x])
PQ.push({t - 1, x + 1, 0});
if (x < N - 1)
PQ.push({t - 1, x + 1, min(y, Tab[x + 1])});
if (x > 0)
PQ.push({t - 1, x - 1, min(y, Tab[x - 1])});
}
}
