#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int N = 100005;
typedef pair<int, int> pi;

vector<int> f(vector<int> a, vector<int> b) {
    int n = b.size();
    vector<int> l(n), r(n + 1), res(n + 1);
    if (n == 0) {
        return vector<int>(1, 0);
    }
    for (int i = 0; i < n; ++i)
        l[i] = max((i ? l[i - 1] : 0), abs(a[i] - b[i]));
    for (int i = n; i; --i)
        r[i] = max(i < n ? r[i + 1] : 0, abs(a[i] - b[i - 1]));
    for (int i = 1; i < n; ++i)
        res[i] = max(l[i - 1], r[i + 1]);
    res[0] = r[1], res[n] = l[n - 1];
    return res;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (int &i : a)
        cin >> i;
    for (int &i : b)
        cin >> i;
    sort(all(a)), sort(all(b));
    int x = 0;
    for (int i = 1; i < n; ++i)
        if (abs(a[i] - b[i]) > abs(a[x] - b[x]))
            x = i;
    vector<int> mn(n, 1e9);
    mn[0] = 0;
    for (int i = 0; i < n; ++i)
        if (i != 0)
            mn[0] = max(mn[0], abs(a[i] - b[i]));
    
    {
        vector<int> tmp = f(vector<int>(b.begin(), b.begin() + x + 1), vector<int>(a.begin(), a.begin() + x));
        vector<int> tmp2 = f(vector<int>(a.begin() + x, a.end()), vector<int>(b.begin() + x + 1, b.end()));
        int mx = *min_element(all(tmp));
        for (int i = x; i < n; ++i)
        mn[i] = min(mn[i], max(tmp2[i - x], mx));
    }
    {
        vector<int> tmp = f(vector<int>(a.begin(), a.begin() + x + 1), vector<int>(b.begin(), b.begin() + x));
        vector<int> tmp2 = f(vector<int>(b.begin() + x, b.end()), vector<int>(a.begin() + x + 1, a.end()));
        int mx = *min_element(all(tmp2));
        for (int i = 0; i <= x; ++i)
        mn[i] = min(mn[i], max(tmp[i], mx));
    }
    x = 0;
    for (int i = 0; i < n; ++i)
        if (mn[i] < mn[x])
            x = i;
    cout << a[x] << '\n';
}