Problem: Recently the construction of Berland collider has been completed. Collider can be represented as a long narrow tunnel that contains n particles. We associate with collider 1-dimensional coordinate system, going from left to right. For each particle we know its coordinate and velocity at the moment of start of the collider. The velocities of the particles don't change after the launch of the collider. Berland scientists think that the big bang will happen at the first collision of particles, whose velocities differs in directions. Help them to determine how much time elapses after the launch of the collider before the big bang happens.

Input

The first line contains single integer n (1 ≤ n ≤ 5·105) — amount of particles in the collider. Next n lines contain description of particles. Each particle is described by two integers xi, vi ( - 109 ≤ xi, vi ≤ 109, vi ≠ 0) — coordinate and velocity respectively. All the coordinates are distinct. The particles are listed in order of increasing of coordinates. All the coordinates are in meters, and all the velocities — in meters per second. The negative velocity means that after the start of collider the particle will move to the left, and the positive — that the particle will move to the right.

Output

If there will be no big bang, output -1. Otherwise output one number — how much time in seconds elapses after the launch of the collider before the big bang happens. Your answer must have a relative or absolute error less than 10 - 9.

Examples

Input

3
-5 9
0 1
5 -1


Output

1.00000000000000000000


Input

6
1 3
2 3
3 3
4 -3
5 -1
6 -100


Output

0.02912621359223301065

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct data {
  int x, v;
  void scan() { scanf("%d%d", &x, &v); }
} a[5000000];
double f(data a1[], int n1, data a2[], int n2) {
  if (n2 == 0) return 1e12;
  int i;
  double left = 0,
         right = (double)(a2[0].x - a1[n1 - 1].x) / (a1[n1 - 1].v - a2[0].v),
         mid, ma, mi;
  while (left + 1e-12 < right && left + left * 1e-12 < right) {
    mid = (left + right) / 2;
    ma = -1e12;
    for (i = 0; i < n1; i++) ma = max(ma, a1[i].x + a1[i].v * mid);
    mi = 1e12;
    for (i = 0; i < n2; i++) mi = min(mi, a2[i].x + a2[i].v * mid);
    if (mi <= ma)
      right = mid;
    else
      left = mid;
  }
  return left;
}
int main() {
  int n, i, j;
  double an = 1e12;
  scanf("%d", &n);
  for (i = 0; i < n; i++) a[i].scan();
  for (i = 0; i < n && a[i].v < 0; i++)
    ;
  for (; i < n; i += j) {
    for (j = 0; i + j < n && a[i + j].v > 0; j++)
      ;
    int half = j;
    for (; i + j < n && a[i + j].v < 0; j++)
      ;
    an = min(an, f(a + i, half, a + i + half, j - half));
  }
  if (an == 1e12)
    puts("-1");
  else
    printf("%.12lf\n", an);
}