#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> B(N);
  for (int i = 0; i < N; i++){
    cin >> B[i];
  }
  vector<pair<int, int>> P;
  for (int i = 0; i < N; i++){
    P.push_back(make_pair(A[i], i));
    P.push_back(make_pair(B[i], i));
    P.push_back(make_pair((A[i] + B[i]) / 2, i));
  }
  sort(P.begin(), P.end());
  vector<int> cnt(N, 0);
  cnt[P[0].second]++;
  int cnt2 = 1;
  int L = 0, R = 0;
  int ans = INF;
  while (true){
    if (cnt2 == N){
      ans = min(ans, P[R].first - P[L].first);
      cnt[P[L].second]--;
      if (cnt[P[L].second] == 0){
        cnt2--;
      }
      L++;
    } else {
      R++;
      if (R == N * 3){
        break;
      }
      if (cnt[P[R].second] == 0){
        cnt2++;
      }
      cnt[P[R].second]++;
    }
  }
  cout << ans << endl;
}