#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<array<int, 3>> a(n);
  rep(i, n) cin >> a[i][0];
  rep(i, n) {
    cin >> a[i][2];
    if (a[i][0] > a[i][2]) swap(a[i][0], a[i][2]);
    a[i][1] = (a[i][0] + a[i][2]) / 2;
  }
  priority_queue<P, vector<P>, greater<P>> q;
  int mx = 0;
  rep(i, n) {
    chmax(mx, a[i][0]);
    q.emplace(a[i][0], 3 * i);
  }
  int ans = 1001001001;
  while(true) {
    auto [mn, s] = q.top(); q.pop();
    chmin(ans, mx - mn);
    int i = s / 3, r = s % 3;
    if (++r == 3) break;
    chmax(mx, a[i][r]);
    q.emplace(a[i][r], s + 1);
  }
  cout << ans << '\n';
}