#include <bits/stdc++.h>
using namespace std;
double eps = 1e-6;
int n;
vector<pair<double, double>> v;
double calc(double f) {
  double mi = 0;
  for (int i = 0; i < n; i++) {
    mi = max(mi, (abs(f - v[i].first) / v[i].second));
  }
  return mi;
}
void solve() {
  cin >> n;
  double x;
  for (int i = 0; i < n; i++) {
    cin >> x;
    v.push_back({x, 0});
  }
  for (int i = 0; i < n; i++) {
    cin >> x;
    v[i].second = x;
  }
  sort((v).begin(), (v).end());
  double l = v[0].first;
  double r = v[n - 1].first;
  double ans = 1000000007;
  if (r == l) {
    printf("%.9f\n", 0);
    return;
  }
  while (r - l > eps) {
    double m1 = l + (r - l) / 3;
    double m2 = r - (r - l) / 3;
    double f1 = calc(m1);
    double f2 = calc(m2);
    if (f1 > f2)
      l = m1;
    else
      r = m2;
    ans = min(ans, min(f1, f2));
  }
  printf("%.9f\n", ans);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
