#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,long long>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<array<int, 3>> a(n);
	rep(i, n) cin >> a[i][0];
	rep(i, n) {
		cin >> a[i][2];
		if (a[i][0] > a[i][2]) swap(a[i][0], a[i][2]);
		a[i][1] = (a[i][0] + a[i][2]) / 2;
	}
	priority_queue<P, vector<P>, greater<P>> pq;
	int mx = 0;
	rep(i, n) {
		chmax(mx, a[i][0]);
		pq.emplace(a[i][0], 3 * i);
	}
	int ans = INF * 2;
	while (true) {
		auto [mn, s] = pq.top();
		pq.pop();
		chmin(ans, mx - mn);
		int i = s / 3, j = s % 3;
		if (++j == 3)break;
		chmax(mx, a[i][j]);
		pq.emplace(a[i][j], s + 1);
	}
	cout << ans << endl;
	return 0;
}