#include <bits/stdc++.h>

#define debug(...) 42;
#ifdef LOCAL
#include "debug.h"
#endif

using namespace std;
#define V vector
#define fi first
#define se second
#define mp make_pair
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define F(i, l, r) for (int i = l; i < r; ++i)
#define R(i, l, r) for (int i = r-1; i >= l; --i)
typedef long long LL;
typedef double DB;
typedef pair<int, int> PII;
template<typename T> bool setmin(T &a, T b) { return (a > b ? a = b, 1 : 0); }
template<typename T> bool setmax(T &a, T b) { return (a < b ? a = b, 1 : 0); }
// mt19937_64 rng {chrono::steady_clock::now().time_since_epoch().count()};

/* -------------Main code------------- */
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int n; cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }

    auto ck = [&](long long mid) {
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            cnt += (a[i] < mid);
        }

        if (cnt <= n / 2) return true;

        vector<int> cont(n);
        for (int i = 0; i < n; i++) {
            if (a[i] < mid and b[i] >= mid) cont[i] = 1;
            if (a[i] >= mid and b[i] < mid) cont[i] = -1;
        }

        vector<int> pref(n);
        pref[0] = cont[0];
        for (int i = 1; i < n; i++) {
            pref[i] = pref[i - 1] + cont[i];
        }

        int mx = -n, minVal = 0;
        for (int i = 0; i < n; i++) {
            setmax(mx, pref[i] - minVal);
            setmin(minVal, pref[i]);
        }

        return (cnt - mx) <= (n / 2);
    };

    long long l = 0, r = 1e9;
    while (l < r) {
        long long mid = (l + r + 1) >> 1;
        if (ck(mid)) l = mid;
        else r = mid - 1;
    }

    cout << l << '\n';

    return 0;
}