/******************************
*    author : @marvinthang    *
*    date : 26 / 01 / 2022    *
******************************/

#include <bits/stdc++.h>

using namespace std;

#define  superspeed  ios_base::sync_with_stdio(false); cin.tie(nullptr); //cout.tie(nullptr);
#define  file(name)  if (fopen (name".inp", "r") ) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }

template <class U, class V> ostream & operator << (ostream& out, const pair<U, V> &p) { return out << '(' << p.first << ", " << p.second << ')'; }
template <class T> ostream & operator << (ostream &out, const vector<T> &vt) { out << '{'; for (size_t i = 0; i + 1 < vt.size(); i++) out << vt[i] << ", "; if (!vt.empty()) out << vt.back(); return out << '}'; }

const 		int MOD = 1e9 + 7;
const     double PI = 3.1415926535897932384626433832795; // acos(-1.0); atan(-1.0);
const     int dir[] = {0, 1, 0, -1, 0}; // {0, 1, 1, -1, -1, 1, 0, -1, 0};
const  long long oo = 1e18;
const       int MAX = 1e5 + 5;
const 		int LOG = 20;

int N, pos[MAX], mi[MAX][LOG], ma[MAX][LOG], lg2[MAX];
int F[MAX];

int dist(int a, int b) {
    int res = a - b;
    if (res < 0) return -res;
    return res;
}

void rmq(void) {
	for (int i = 1; i <= N; ++i) {
		mi[i][0] = ma[i][0] = pos[i];
		lg2[i] = lg2[i - 1];
		while (1 << lg2[i] <= i) ++lg2[i]; --lg2[i];
	}
	for (int k = 1; k < LOG; ++k) {
		for (int i = 1; i + (1 << k) - 1 <= N; ++i) {
			mi[i][k] = min(mi[i][k - 1], mi[i + (1 << k - 1)][k - 1]);
			ma[i][k] = max(ma[i][k - 1], ma[i + (1 << k - 1)][k - 1]);
		}
	}
}

int getMin(int l, int r) {
	assert(l <= r);
	int k = lg2[r - l + 1];
	return min(mi[l][k], mi[r - (1 << k) + 1][k]);
}

int getMax(int l, int r) {
	assert(l <= r);
	int k = lg2[r - l + 1];
	return max(ma[l][k], ma[r - (1 << k) + 1][k]);
}

bool check(int d) {
	memset(F, 0, sizeof(F));
	F[1] = 1; F[2] = -1;
	for (int i = 1; i < N; ++i) {
		F[i] += F[i - 1];
		if (!F[i]) return false;
		// int tmp = i;
		int l = i, r = N;
		while (l <= r) {
			int mid = l + r >> 1;
			if (dist(getMin(i, mid), pos[i]) <= d && dist(getMax(i, mid), pos[i]) <= d) l = mid + 1;
			else r = mid - 1;
		}
		// while (tmp <= N && dist(pos[tmp], pos[i]) <= d) ++tmp; --tmp;
		++F[i + 1]; --F[r + 1];
	}
	return F[N] + F[N - 1];
}

int main(void) {
    superspeed;
    file("vnuoi22_post");
    cin >> N; N += 2;
    for (int i = 1; i <= N; ++i) cin >> pos[i];
    rmq();
    int l = dist(pos[1], pos[2]), r = 1e9;
	while (l <= r) {
		int mid = l + r >> 1;
		if (check(mid)) {
			r = mid - 1;
		} else l = mid + 1;
	}
	cout << l << '\n';
    return 0;
}