#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n), b(n);
  REP(i, n) cin >> a[i], a[i] /= 2;
  REP(i, n) cin >> b[i], b[i] /= 2;
  REP(i, n) {
    if (a[i] > b[i]) swap(a[i], b[i]);
  }
  vector<int> v;
  v.reserve(n * 3);
  REP(i, n) {
    v.emplace_back(a[i] * 2);
    v.emplace_back(a[i] + b[i]);
    v.emplace_back(b[i] * 2);
  }
  ranges::sort(v);
  v.erase(unique(ALL(v)), v.end());
  map<int, vector<int>> pos;
  REP(i, n) pos[a[i] * 2].emplace_back(i);
  int ans = INF;
  for (const int min_c : v) {
    while (pos.begin()->first < min_c) {
      const vector<int> tmp = pos.begin()->second;
      pos.erase(pos.begin());
      for (const int i : tmp) {
        if (min_c <= a[i] + b[i]) {
          pos[a[i] + b[i]].emplace_back(i);
        } else if (min_c <= b[i] * 2) {
          pos[b[i] * 2].emplace_back(i);
        } else {
          cout << ans << '\n';
          return 0;
        }
      }
    }
    chmin(ans, pos.rbegin()->first - min_c);
  }
  cout << ans << '\n';
  return 0;
}