/* -*- coding: utf-8 -*-
 *
 * 2248.cc:  No.2248 max(C)-min(C) - yukicoder
 */

#include<cstdio>
#include<vector>
#include<set>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;
const int INF = 1 << 30;

/* typedef */

typedef vector<int> vi;

/* global variables */

int as[MAX_N], bs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < n; i++) scanf("%d", bs + i);

  multiset<vi> pvs;
  for (int i = 0; i < n; i++) {
    if (as[i] > bs[i]) swap(as[i], bs[i]);
    pvs.insert({as[i], (as[i] + bs[i]) / 2, bs[i]});
  }

  int mind = INF;
  for (;;) {
    auto sit = pvs.end(); sit--;
    int d = (*sit)[0] - (*pvs.begin())[0];
    mind = min(mind, d);

    auto v = *pvs.begin();
    pvs.erase(pvs.begin());
    if (v.size() == 3)
      pvs.insert({v[1], v[2]});
    else if (v.size() == 2)
      pvs.insert({v[1]});
    else
      break;
  }

  printf("%d\n", mind);
  return 0;
}