#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
#define int long long
#define fi first
#define se second
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define all(x) x.begin(), x.end()
const int N = 2005;
int a[2 * N], b[N], c[N];
void solve() {
int n;
cin >> n;
for (int i = 1; i <= 2 * n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) cin >> b[i];
for (int i = 1; i <= n; i++) cin >> c[i];
sort(b + 1, b + n + 1);
sort(c + 1, c + n + 1);
int mini = 1e18;
for (int lp = 1; lp <= 2 * n; lp++) {
vector<int> x, y;
int pt = lp;
for (int i = 1; i <= 2 * n; i++) {
if (i <= n) x.push_back(a[lp]);
else y.push_back(a[lp]);
lp++;
if (lp > 2 * n) lp = 1;
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
int cost = 0;
for (int i = 0; i < n; i++) {
cost = max(cost, abs(x[i] - b[i + 1]));
cost = max(cost, abs(y[i] - c[i + 1]));
}
mini = min(mini, cost);
}
cout << mini << '\n';
}
int32_t main() {
ios::sync_with_stdio(0); cin.tie(0);
int test = 1;
// cin >> test;
while (test--) solve();
}
