#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
void solve() {
int n, sx, sy, tx, ty;
cin >> n >> sy >> sx >> ty >> tx;
vector<int> a(n);
for (int &i : a) cin >> i;
auto dis = [](int fx, int fy, int ex, int ey) {
return abs(fx - ex) + abs(fy - ey);
};
int ans = dis(sx, sy, tx, ty);
if (sy != 1) chmin(ans, sx + dis(a[0] + 1, sy - 1, tx, ty));
if (sy != n) chmin(ans, a[0] - sx + 2 + dis(1, sy + 1, tx, ty));
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
int t = 1;
//cin >> t;
while(t--){
solve();
}
}
