#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <stack>
typedef long long ll;
using namespace std;
const int N = 1e6 + 10;
int l[N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
int sl, sc, el, ec;
cin >> sl >> sc >> el >> ec;
for (int i = 1; i <= n; i++) {
cin >> l[i];
l[i]++;
}
if (n == 1) {
cout << abs(sc - ec) << "\n";
return 0;
}
if (n == 2) {
if (sl == el) {
if (sc > ec) swap(sc, ec);
if (sl == 1) {
cout << min(abs(sc - ec), l[1] - ec + 1 + sc) << "\n";
}
else {
cout << min(abs(sc - ec), l[2] - ec + 1 + sc) << "\n";
}
}
else {
int k = 1, z = 0;
cout << k / z << endl;
if (sl == 2) {
swap(sl, el);
swap(sc, ec);
}
cout << min(1 + abs(min(l[2], sc) - ec), ec + l[1] - sc) << "\n";
}
}
}
