#include <bits/stdc++.h>
using namespace std;
const int maxn = 6e4 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3fffffff;
int x[maxn], v[maxn], n;
bool canmeet(double time) {
  double left, right;
  for (int i = 1; i <= n; i++) {
    if (i == 1) {
      left = x[i] - time * v[i];
      right = x[i] + time * v[i];
    } else {
      double le, ri;
      le = x[i] - time * v[i];
      ri = x[i] + time * v[i];
      if (le > right || ri < left) return false;
      left = max(left, le);
      right = min(right, ri);
    }
  }
  return true;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> x[i];
  for (int i = 1; i <= n; i++) cin >> v[i];
  double l = 0, r = 1e9;
  while (r - l > 1e-6) {
    double mid = (l + r) / 2;
    if (canmeet(mid))
      r = mid;
    else
      l = mid;
  }
  cout << fixed << setprecision(12) << r << endl;
  return ~~(0 - 0);
}
