#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int infi = INT_MAX;
const long long infll = LLONG_MAX;
const long double PI = 3.1415926535897932384626;
long double check(long double val, vector<pair<long double, long double> > &v) {
  long double mm = 0;
  for (int i = 0; i < v.size(); ++i) {
    mm = max(mm, abs(val - v[i].first) / v[i].second);
  }
  return mm;
}
void solve(int test_case) {
  int n;
  cin >> n;
  vector<pair<long double, long double> > v(n);
  for (auto &i : v) cin >> i.first;
  for (auto &i : v) cin >> i.second;
  long double hi = 1e9;
  long double lo = 0;
  long double ans = check(hi, v);
  while (hi - lo > 1e-9) {
    long double m1 = lo + (hi - lo) / 3.0;
    long double m2 = hi - (hi - lo) / 3.0;
    long double f1 = check(m1, v);
    long double f2 = check(m2, v);
    if (f1 > f2) {
      lo = m1;
      ans = min(ans, f2);
    } else {
      hi = m2;
      ans = min(ans, f1);
    }
  }
  cout << setprecision(10) << fixed << ans;
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tc = 1;
  while (tc--) solve(tc);
  return 0;
}
