#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
bool assign_min(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<typename T>
bool assign_max(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll solve(vector<int> a, vector<int> b) {
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int ans = 0;
for (int i = 0; i < a.size(); i++) {
assign_max(ans, abs(a[i] - b[i]));
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(2 * n);
vector<int> b(n), c(n);
for (int i = 0; i < 2 * n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
}
ll ans = 1e18;
for (int mask = 0; mask < (1 << (2 * n)); mask++) {
if (__builtin_popcount(mask) != n) {
continue;
}
vector<int> v1, v2;
vector<int> bit(2 * n);
for (int i = 0; i < 2 * n; i++) {
if (mask & (1 << i)) {
bit[i] = 1;
v1.push_back(a[i]);
} else {
v2.push_back(a[i]);
}
}
int f = 1, cons = 1;
for (int i = 0; i + 1 < 2 * n; i++) {
if (bit[i] == bit[i + 1]) {
f++;
} else {
f = 1;
}
assign_max(cons, f);
}
if (cons < n) {
continue;
}
assign_min(ans, max(solve(v1, b), solve(v2, c)));
}
cout << ans << "\n";
}
