#include <bits/stdc++.h>
using namespace std;
int n, A[1000001], B[1000001];
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> A[i];
    for (int i = 1; i <= n; i++) cin >> B[i];
    sort(A + 1, A + n + 1);
    sort(B + 1, B + n + 1);
    int k = 2e9;
    for (int i = 1, j = n; i <= n; i++) {
        while (j > 0 && A[i] + B[j] > 0) k = min(k, A[i] + B[j]), j--;
        if (j > 0) k = min(k, -(A[i] + B[j]));
    }
    cout << k;
    return 0;
}