Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.

The desk can be considered as an infinite plane, then the mousetrap is a rectangle which sides are parallel to the axes, and which opposite sides are located in points (x1, y1) and (x2, y2).

Igor wants to catch all mice. Igor has analysed their behavior and discovered that each mouse is moving along a straight line with constant speed, the speed of the i-th mouse is equal to (vix, viy), that means that the x coordinate of the mouse increases by vix units per second, while the y coordinates increases by viy units. The mousetrap is open initially so that the mice are able to move freely on the desk. Igor can close the mousetrap at any moment catching all the mice that are strictly inside the mousetrap.

Igor works a lot, so he is busy in the dream as well, and he asks you to write a program that by given mousetrap's coordinates, the initial coordinates of the mice and their speeds determines the earliest time moment in which he is able to catch all the mice. Please note that Igor can close the mousetrap only once.

Input

The first line contains single integer n (1 ≤ n ≤ 100 000) — the number of computer mice on the desk.

The second line contains four integers x1, y1, x2 and y2 (0 ≤ x1 ≤ x2 ≤ 100 000), (0 ≤ y1 ≤ y2 ≤ 100 000) — the coordinates of the opposite corners of the mousetrap.

The next n lines contain the information about mice.

The i-th of these lines contains four integers rix, riy, vix and viy, (0 ≤ rix, riy ≤ 100 000,  - 100 000 ≤ vix, viy ≤ 100 000), where (rix, riy) is the initial position of the mouse, and (vix, viy) is its speed.

Output

In the only line print minimum possible non-negative number t such that if Igor closes the mousetrap at t seconds from the beginning, then all the mice are strictly inside the mousetrap. If there is no such t, print -1.

Your answer is considered correct if its absolute or relative error doesn't exceed 10 - 6. 

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if <image>.

Examples

Input

4
7 7 9 8
3 5 7 5
7 5 2 4
3 3 7 8
6 6 3 2


Output

0.57142857142857139685


Input

4
7 7 9 8
0 3 -5 4
5 0 5 4
9 9 -1 -6
10 5 -7 -10


Output

-1

Note

Here is a picture of the first sample

Points A, B, C, D - start mice positions, segments are their paths.

<image>

Then, at first time when all mice will be in rectangle it will be looks like this:

<image>

Here is a picture of the second sample

<image>

Points A, D, B will never enter rectangle.
#include <bits/stdc++.h>
using namespace std;
static const long long COUNTER_CLOCKWISE = 1;
static const long long CLOCKWISE = -1;
static const long long ONLINE_BACK = 2;
static const long long ONLINE_FRONT = -2;
static const long long ON_SEGMENT = 0;
struct Point {
  double x, y;
  Point() {}
  Point(double x, double y) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double k) { return Point(x * k, y * k); }
  Point operator/(double k) { return Point(x / k, y / k); }
  double norm() { return x * x + y * y; }
  double abs() { return sqrt(norm()); }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);
  }
};
istream &operator>>(istream &is, Point &p) {
  is >> p.x >> p.y;
  return is;
}
ostream &operator<<(ostream &os, Point p) {
  os << fixed << setprecision(12) << p.x << " " << p.y;
  return os;
}
struct Segment {
  Point p1, p2;
  Segment() {}
  Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
};
struct Circle {
  Point c;
  double r;
  Circle() {}
  Circle(Point c, double r) : c(c), r(r) {}
};
double norm(Point a) { return a.x * a.x + a.y * a.y; }
double abs(Point a) { return sqrt(norm(a)); }
double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
bool isOrthogonal(Point a, Point b) {
  return (fabs((dot(a, b)) - (0.0)) < (1e-10));
}
bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
  return isOrthogonal(a1 - a2, b1 - b2);
}
bool isOrthogonal(Segment s1, Segment s2) {
  return (fabs((dot(s1.p2 - s1.p1, s2.p2 - s2.p1)) - (0.0)) < (1e-10));
}
bool isParallel(Point a, Point b) {
  return (fabs((cross(a, b)) - (0.0)) < (1e-10));
}
bool isParallel(Point a1, Point a2, Point b1, Point b2) {
  return isParallel(a1 - a2, b1 - b2);
}
bool isParallel(Segment s1, Segment s2) {
  return (fabs((cross(s1.p2 - s1.p1, s2.p2 - s2.p1)) - (0.0)) < (1e-10));
}
Point project(Segment s, Point p) {
  Point base = s.p2 - s.p1;
  double r = dot(p - s.p1, base) / norm(base);
  return s.p1 + base * r;
}
Point reflect(Segment s, Point p) { return p + (project(s, p) - p) * 2.0; }
long long ccw(Point p0, Point p1, Point p2) {
  Point a = p1 - p0;
  Point b = p2 - p0;
  if (cross(a, b) > (1e-10)) return COUNTER_CLOCKWISE;
  if (cross(a, b) < -(1e-10)) return CLOCKWISE;
  if (dot(a, b) < -(1e-10)) return ONLINE_BACK;
  if (a.norm() < b.norm()) return ONLINE_FRONT;
  return ON_SEGMENT;
}
bool intersect(Point p1, Point p2, Point p3, Point p4) {
  return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
          ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
bool intersect(Segment s1, Segment s2) {
  return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
double getDistanceLP(Segment l, Point p) {
  return abs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));
}
double getDistanceSP(Segment s, Point p) {
  if (dot(s.p2 - s.p1, p - s.p1) < 0.0) return abs(p - s.p1);
  if (dot(s.p1 - s.p2, p - s.p2) < 0.0) return abs(p - s.p2);
  return getDistanceLP(s, p);
}
double getDistance(Segment s1, Segment s2) {
  if (intersect(s1, s2)) return 0.0;
  return min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),
             min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)));
}
Point getCrossPoint(Segment s1, Segment s2) {
  Point base = s2.p2 - s2.p1;
  double d1 = abs(cross(base, s1.p1 - s2.p1));
  double d2 = abs(cross(base, s1.p2 - s2.p1));
  double t = d1 / (d1 + d2);
  return s1.p1 + (s1.p2 - s1.p1) * t;
}
pair<Point, Point> getCrossPoints(Circle c, Segment l) {
  Point pr = project(l, c.c);
  Point e = (l.p2 - l.p1) / abs(l.p2 - l.p1);
  double base = sqrt(c.r * c.r - norm(pr - c.c));
  return make_pair(pr + e * base, pr - e * base);
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
  double d = abs(c1.c - c2.c);
  double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
  double t = arg(c2.c - c1.c);
  return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
long long contains(vector<Point> g, Point p) {
  long long n = g.size();
  bool x = false;
  for (long long i = 0; i < n; i++) {
    Point a = g[i] - p, b = g[(i + 1) % n] - p;
    if (fabs(cross(a, b)) < (1e-10) && dot(a, b) < (1e-10)) return 1;
    if (a.y > b.y) swap(a, b);
    if (a.y < (1e-10) && (1e-10) < b.y && cross(a, b) > (1e-10)) x = !x;
  }
  return (x ? 2 : 0);
}
vector<Point> andrewScan(vector<Point> s) {
  vector<Point> u, l;
  if (s.size() < 3) return s;
  sort(s.begin(), s.end());
  u.push_back(s[0]);
  u.push_back(s[1]);
  l.push_back(s[s.size() - 1]);
  l.push_back(s[s.size() - 2]);
  for (long long i = 2; i < (long long)s.size(); i++) {
    for (long long n = u.size();
         n >= 2 && ccw(u[n - 2], u[n - 1], s[i]) != CLOCKWISE; n--) {
      u.pop_back();
    }
    u.push_back(s[i]);
  }
  for (long long i = s.size() - 3; i >= 0; i--) {
    for (long long n = l.size();
         n >= 2 && ccw(l[n - 2], l[n - 1], s[i]) != CLOCKWISE; n--) {
      l.pop_back();
    }
    l.push_back(s[i]);
  }
  reverse(l.begin(), l.end());
  for (long long i = u.size() - 2; i >= 1; i--) l.push_back(u[i]);
  return l;
}
bool isConvex(vector<Point> p) {
  bool f = 1;
  long long n = p.size();
  for (long long i = 0; i < n; i++) {
    long long t = ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]);
    f &= t != CLOCKWISE;
  }
  return f;
}
double area(vector<Point> s) {
  double res = 0;
  for (long long i = 0; i < (long long)s.size(); i++) {
    res += cross(s[i], s[(i + 1) % s.size()]) / 2.0;
  }
  return abs(res);
}
Point getCrossPointLL(Segment l1, Segment l2) {
  double a = cross(l1.p2 - l1.p1, l2.p2 - l2.p1);
  double b = cross(l1.p2 - l1.p1, l1.p2 - l2.p1);
  if (abs(a) < (1e-10) && abs(b) < (1e-10)) return l2.p1;
  return l2.p1 + (l2.p2 - l2.p1) * (b / a);
}
vector<Point> convexCut(vector<Point> p, Segment l) {
  vector<Point> q;
  for (long long i = 0; i < (long long)p.size(); i++) {
    Point a = p[i], b = p[(i + 1) % p.size()];
    if (ccw(l.p1, l.p2, a) != -1) q.push_back(a);
    if (ccw(l.p1, l.p2, a) * ccw(l.p1, l.p2, b) < 0)
      q.push_back(getCrossPointLL(Segment(a, b), l));
  }
  return q;
}
Segment bisector(Point p1, Point p2) {
  Circle c1 = Circle(p1, abs(p1 - p2)), c2 = Circle(p2, abs(p1 - p2));
  pair<Point, Point> p = getCrossPoints(c1, c2);
  if (cross(p2 - p1, p.first - p1) > 0) swap(p.first, p.second);
  return Segment(p.first, p.second);
}
Point spin(Point v, double theta) {
  Point res;
  res.x = cos(theta) * v.x - sin(theta) * v.y;
  res.y = sin(theta) * v.x + cos(theta) * v.y;
  return res;
}
vector<Segment> corner(Segment l1, Segment l2) {
  vector<Segment> res;
  if (isParallel(l1, l2)) {
    double d = getDistanceLP(l1, l2.p1) / 2.0;
    Point v1 = l1.p2 - l1.p1;
    v1 = v1 / v1.abs() * d;
    Point p = l2.p1 + spin(v1, 90.0 * (3.141592653589793238 / 180.0));
    double d1 = getDistanceLP(l1, p);
    double d2 = getDistanceLP(l2, p);
    if (abs(d1 - d2) > d) {
      p = l2.p1 + spin(v1, -90.0 * (3.141592653589793238 / 180.0));
    }
    res.push_back(Segment(p, p + v1));
  } else {
    Point p = getCrossPointLL(l1, l2);
    Point v1 = l1.p2 - l1.p1, v2 = l2.p2 - l2.p1;
    v1 = v1 / v1.abs();
    v2 = v2 / v2.abs();
    res.push_back(Segment(p, p + (v1 + v2)));
    res.push_back(
        Segment(p, p + spin(v1 + v2, 90.0 * (3.141592653589793238 / 180.0))));
  }
  return res;
}
double diameter(vector<Point> s) {
  vector<Point> p = s;
  long long n = p.size();
  if (n == 2) return abs(p[0] - p[1]);
  long long i = 0, j = 0;
  for (long long k = 0; k < n; k++) {
    if (p[i].x < p[k].x) i = k;
    if (p[j].x > p[k].x) j = k;
  }
  double res = 0;
  long long si = i, sj = j;
  do {
    res = max(res, abs(p[i] - p[j]));
    if (cross(p[(i + i) % n] - p[i], p[(j + 1) % n] - p[j]) < 0.0) {
      i = (i + 1) % n;
    } else {
      j = (j + 1) % n;
    }
  } while (i != si || j != sj);
  return res;
}
signed main() {
  long long n;
  scanf("%lld", &n);
  vector<Point> r(4);
  scanf("%lf %lf", &(r[0].x), &(r[0].y));
  scanf("%lf %lf", &(r[2].x), &(r[2].y));
  r[1] = Point(r[2].x, r[0].y);
  r[3] = Point(r[0].x, r[2].y);
  Segment l[4];
  l[0] = Segment(r[0], r[1]);
  l[1] = Segment(r[1], r[2]);
  l[2] = Segment(r[2], r[3]);
  l[3] = Segment(r[3], r[0]);
  vector<Point> p(n), v(n);
  for (long long i = 0; i < n; i++) {
    scanf("%lf %lf", &(p[i].x), &(p[i].y));
    scanf("%lf %lf", &(v[i].x), &(v[i].y));
  }
  double INF = 1e8;
  double L = 0, R = INF;
  bool f = 1;
  for (long long i = 0; i < n; i++) {
    long long c = contains(r, p[i]);
    if ((fabs((abs(v[i])) - (0)) < (1e-10))) {
      if (c == 2) continue;
      f = 0;
      break;
    }
    Segment s = Segment(p[i], p[i] + v[i] * INF);
    long long fs = 0, fp = 0;
    for (long long j = 0; j < 4; j++) {
      fs += intersect(s, l[j]);
      fp += (fabs((getDistanceSP(s, r[j])) - (0.0)) < (1e-10));
    }
    if (c == 0) {
      if ((fs == 0) || (fs == 2 && fp == 1) || (fs == 3 && fp == 2)) {
        f = 0;
        break;
      }
    }
    if (c == 1) {
      if ((fs == 2 && fp == 1) || (fs == 3 && fp == 2)) {
        f = 0;
        break;
      }
    }
    double tL = INF, tR = 0;
    if (c == 2) tL = 0;
    for (long long j = 0; j < 4; j++) {
      if (!intersect(s, l[j])) continue;
      double xL = 0, xR = INF;
      for (long long k = 0; k < 120; k++) {
        double xM = (xL + xR) / 2;
        Segment t = Segment(p[i], p[i] + v[i] * xM);
        if (intersect(t, l[j]))
          xR = xM;
        else
          xL = xM;
      }
      tL = min(tL, xR);
      tR = max(tR, xR);
    }
    L = max(L, tL);
    R = min(R, tR);
  }
  if (f && !(fabs((L) - (R)) < (1e-10)) && (L < R))
    printf("%.20f\n", L);
  else
    cout << -1 << endl;
  return 0;
}
