Problem: Limak is a big polar bear. He prepared n problems for an algorithmic contest. The i-th problem has initial score pi. Also, testers said that it takes ti minutes to solve the i-th problem. Problems aren't necessarily sorted by difficulty and maybe harder problems have smaller initial score but it's too late to change it — Limak has already announced initial scores for problems. Though it's still possible to adjust the speed of losing points, denoted by c in this statement.

Let T denote the total number of minutes needed to solve all problems (so, T = t1 + t2 + ... + tn). The contest will last exactly T minutes. So it's just enough to solve all problems.

Points given for solving a problem decrease linearly. Solving the i-th problem after x minutes gives exactly <image> points, where <image> is some real constant that Limak must choose.

Let's assume that c is fixed. During a contest a participant chooses some order in which he or she solves problems. There are n! possible orders and each of them gives some total number of points, not necessarily integer. We say that an order is optimal if it gives the maximum number of points. In other words, the total number of points given by this order is greater or equal than the number of points given by any other order. It's obvious that there is at least one optimal order. However, there may be more than one optimal order.

Limak assumes that every participant will properly estimate ti at the very beginning and will choose some optimal order. He also assumes that testers correctly predicted time needed to solve each problem.

For two distinct problems i and j such that pi < pj Limak wouldn't be happy to see a participant with strictly more points for problem i than for problem j. He calls such a situation a paradox.

It's not hard to prove that there will be no paradox for c = 0. The situation may be worse for bigger c. What is the maximum real value c (remember that <image>) for which there is no paradox possible, that is, there will be no paradox for any optimal order of solving problems?

It can be proved that the answer (the maximum c as described) always exists.

Input

The first line contains one integer n (2 ≤ n ≤ 150 000) — the number of problems.

The second line contains n integers p1, p2, ..., pn (1 ≤ pi ≤ 108) — initial scores.

The third line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 108) where ti is the number of minutes needed to solve the i-th problem.

Output

Print one real value on a single line — the maximum value of c that <image> and there is no optimal order with a paradox. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct if <image>.

Examples

Input

3
4 3 10
1 1 8


Output

0.62500000000


Input

4
7 20 15 10
7 20 15 10


Output

0.31901840491


Input

2
10 20
10 1


Output

1.00000000000

Note

In the first sample, there are 3 problems. The first is (4, 1) (initial score is 4 and required time is 1 minute), the second problem is (3, 1) and the third one is (10, 8). The total time is T = 1 + 1 + 8 = 10.

Let's show that there is a paradox for c = 0.7. Solving problems in order 1, 2, 3 turns out to give the best total score, equal to the sum of:

  1. solved 1 minute after the start: <image>
  2. solved 2 minutes after the start: <image>
  3. solved 10 minutes after the start: <image>



So, this order gives 3.72 + 2.58 + 3 = 9.3 points in total and this is the only optimal order (you can calculate total scores for other 5 possible orders too see that they are lower). You should check points for problems 1 and 3 to see a paradox. There is 4 < 10 but 3.72 > 3. It turns out that there is no paradox for c = 0.625 but there is a paradox for any bigger c.

In the second sample, all 24 orders are optimal.

In the third sample, even for c = 1 there is no paradox.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const long long inf = 1e18;
const double eps = 1e-9;
const double pi = 4 * atan(1.0);
const int N = int(2e5) + 100;
const int ITERS = 80;
int m;
pair<int, int> a[N];
vector<pair<int, int> > group[N];
long long sum_t[N];
int p[N];
double fen_suff[N];
inline long long val(const pair<int, int>& a, const pair<int, int>& b) {
  return 1LL * a.first * b.second - 1LL * b.first * a.second;
}
inline bool cmp(const pair<int, int>& a, const pair<int, int>& b) {
  return val(a, b) > 0;
}
inline void add_suff(int cp, double val) {
  int pos = lower_bound(p, p + m, cp) - p;
  assert(pos < m && p[pos] == cp);
  while (pos >= 0) {
    if (val < fen_suff[pos]) {
      fen_suff[pos] = val;
    } else {
      break;
    }
    pos = (pos & (pos + 1)) - 1;
  }
}
inline double get_suff(int cp) {
  int pos = lower_bound(p, p + m, cp) - p;
  assert(pos < m && p[pos] == cp);
  double res = 1e100;
  ++pos;
  while (pos < m) {
    res = min(res, fen_suff[pos]);
    pos = (pos | (pos + 1));
  }
  return res;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i].first);
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i].second);
  }
  sort(a, a + n, cmp);
  for (int i = 0; i < n; ++i) {
    p[i] = a[i].first;
  }
  sort(p, p + n);
  m = unique(p, p + n) - p;
  int i = 0, sz = 0;
  while (i < n) {
    int j = i;
    while (j + 1 < n && val(a[i], a[j + 1]) == 0) {
      ++j;
    }
    for (int z = i; z <= j; ++z) {
      group[sz].push_back(a[z]);
    }
    sort((group[sz]).begin(), (group[sz]).end());
    ++sz;
    i = j + 1;
  }
  for (int i = 0; i < sz; ++i) {
    if (i > 0) {
      sum_t[i] += sum_t[i - 1];
    }
    for (pair<int, int> p : group[i]) {
      sum_t[i] += p.second;
    }
  }
  double l = 0, r = 1;
  for (int it = 0; it < ITERS; ++it) {
    double mid = (l + r) / 2;
    for (int i = 0; i < m; ++i) {
      fen_suff[i] = 1e100;
    }
    bool fl = false;
    for (int i = sz - 1; i >= 0 && !fl; --i) {
      int ptr = ((int)(group[i]).size()) - 1;
      for (int j = ((int)(group[i]).size()) - 1; j >= 0; --j) {
        while (group[i][ptr].first > group[i][j].first) {
          add_suff(
              group[i][ptr].first,
              group[i][ptr].first * (1.0 - mid * sum_t[i] / sum_t[sz - 1]));
          --ptr;
        }
        if (group[i][j].first *
                (1.0 - mid * ((i > 0 ? sum_t[i - 1] : 0) + group[i][j].second) /
                           sum_t[sz - 1]) >
            get_suff(group[i][j].first)) {
          fl = true;
          break;
        }
      }
      while (ptr >= 0) {
        add_suff(group[i][ptr].first,
                 group[i][ptr].first * (1.0 - mid * sum_t[i] / sum_t[sz - 1]));
        --ptr;
      }
    }
    if (fl) {
      r = mid;
      continue;
    }
    for (int i = 0; i < m; ++i) {
      fen_suff[i] = 1e100;
    }
    for (int i = 0; i < sz && !fl; ++i) {
      int ptr = ((int)(group[i]).size()) - 1;
      for (int j = ((int)(group[i]).size()) - 1; j >= 0; --j) {
        while (group[i][ptr].first > group[i][j].first) {
          add_suff(
              group[i][ptr].first,
              group[i][ptr].first * (1.0 - mid * sum_t[i] / sum_t[sz - 1]));
          --ptr;
        }
        if (group[i][j].first *
                (1.0 - mid * ((i > 0 ? sum_t[i - 1] : 0) + group[i][j].second) /
                           sum_t[sz - 1]) >
            get_suff(group[i][j].first)) {
          fl = true;
          break;
        }
      }
      while (ptr >= 0) {
        add_suff(group[i][ptr].first,
                 group[i][ptr].first * (1.0 - mid * sum_t[i] / sum_t[sz - 1]));
        --ptr;
      }
    }
    if (fl) {
      r = mid;
    } else {
      l = mid;
    }
  }
  printf("%.18lf\n", (l + r) / 2);
  return 0;
}