#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> mas;
int ch[5001];
int sum[5001];
int r1, c1, r2, c2;
int main() {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    int n;
    cin >> n;
    mas.resize(n, 0);
    int k = 0;
    for (int i = 0; i < n; i++) {
        cin >> mas[i];
    }
    cin >> r1 >> c1 >> r2 >> c2;
    int minn = 1001000;
    if (c2 >= c1) {
        int curm = 1000100;
        for (int j = min(r1 - 1, r2 - 1); j <= max(r1 - 1, r2 - 1); j++ ) {
            curm = min(curm, mas[j] + 1);
        }
        cout << abs(min(curm, c1) - c2) + abs(r2 - r1);
        return 0;
    }
    int p = 0;
    for (int i = 0; i < n; i++) {
        if (i == r1 - 1)
            continue;
        int curm = 1000100;
        for (int j = min(i, r1 - 1 ); j <= max(i, r1 - 1); j++ ) {
            curm = min(curm, mas[j] + 1);
        }
        if ((long long(r1 - i - 1) * long long(r1 - r2)) < 0) {
            p = abs(r1 - i - 1) * 2 + abs(r1 - r2) + abs(curm - c2);
        } else if ((long long(r1 - i - 1) * long long(r1 - r2)) >= 0) {
            if (abs(r1 - r2) <= abs(r1 - i - 1)) {
                p = abs(r1 - i - 1)  + abs(i + 1 - r2) + abs(curm - c2);
            } else if (abs(r1 - r2) > abs(r1 - i - 1)) {
                p = abs(r1 - r2) + abs(curm - c2);
            }
        }
        minn = min(minn, p);
    }
    cout << minn;
    return 0;
}