#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define int long long

const int mxn = 1e6+5;
const int inf = 1e18;

int n,l[mxn],sl,sc,el,ec;
int ans = inf;
queue<array<int,3>> bfs;

map<array<int,2>,int> memo;

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	cin>>n>>sl>>sc>>el>>ec;
	for (int i=1; i<=n; i++) {
		cin>>l[i];
	}
	bfs.push({sl,sc,0});
	while (sz(bfs)) {
		auto [x,y,d] = bfs.front(); bfs.pop();
		y = min(y,l[x]+1);
		if (memo.count({x,y}) && memo[{x,y}] <= d) continue;
		memo[{x,y}] = d;
		if (el==x) {
			ans = min(ans,d+abs(ec-y));
		}
		if (x > 1) {
			//move up
			bfs.push({x-1,y,d+1});
			//move to end of next line
			bfs.push({x-1,l[x-1]+1,d+y});
		}
		if (x < n) {
			//move down
			bfs.push({x+1,y,d+1});
			//move to beginning of line
			bfs.push({x+1,1,l[x]+1-y+d});
		}
	}
	cout<<ans;
}