Problem: You know, it's hard to conduct a show with lots of participants and spectators at the same place nowadays. Still, you are not giving up on your dream to make a car crash showcase! You decided to replace the real cars with remote controlled ones, call the event "Remote Control Kaboom Show" and stream everything online.

For the preparation you arranged an arena — an infinite 2D-field. You also bought n remote controlled cars and set them up on the arena. Unfortunately, the cars you bought can only go forward without turning left, right or around. So you additionally put the cars in the direction you want them to go.

To be formal, for each car i (1 ≤ i ≤ n) you chose its initial position (x_i, y_i) and a direction vector (dx_i, dy_i). Moreover, each car has a constant speed s_i units per second. So after car i is launched, it stars moving from (x_i, y_i) in the direction (dx_i, dy_i) with constant speed s_i.

The goal of the show is to create a car collision as fast as possible! You noted that launching every car at the beginning of the show often fails to produce any collisions at all. Thus, you plan to launch the i-th car at some moment t_i. You haven't chosen t_i, that's yet to be decided. Note that it's not necessary for t_i to be integer and t_i is allowed to be equal to t_j for any i, j.

The show starts at time 0. The show ends when two cars i and j (i ≠ j) collide (i. e. come to the same coordinate at the same time). The duration of the show is the time between the start and the end.

What's the fastest crash you can arrange by choosing all t_i? If it's possible to arrange a crash then print the shortest possible duration of the show. Otherwise, report that it's impossible.

Input

The first line contains a single integer n (1 ≤ n ≤ 25000) — the number of cars.

Each of the next n lines contains five integers x_i, y_i, dx_i, dy_i, s_i (-10^3 ≤ x_i, y_i ≤ 10^3; 1 ≤ |dx_i| ≤ 10^3; 1 ≤ |dy_i| ≤ 10^3; 1 ≤ s_i ≤ 10^3) — the initial position of the i-th car, its direction vector and its speed, respectively.

It's guaranteed that all cars start at distinct positions (i. e. (x_i, y_i) ≠ (x_j, y_j) for i ≠ j).

Output

Print the shortest possible duration of the show if it's possible to arrange a crash by choosing all t_i. Otherwise, print "No show :(".

Your answer is considered correct if its absolute or relative error does not exceed 10^{-6}.

Formally, let your answer be a, and the jury's answer be b. Your answer is accepted if and only if \frac{|a - b|}{max{(1, |b|)}} ≤ 10^{-6}.

Examples

Input


4
3 -1 -1 1 2
2 3 -3 -2 10
-4 2 1 -2 1
-2 -2 -1 2 4


Output


0.585902082262898


Input


2
-1 1 -1 1 200
1 1 1 5 200


Output


No show :(

Note

Here is the picture for the first example: 

<image>

The fastest cars to crash are cars 2 and 4. Let's launch car 2 at 0, car 4 at about 0.096762 and cars 1 and 3 at arbitrary time. That way cars 2 and 4 will crash into each other at about 0.585902. So here's what it looks like at the moment of the collision:

<image>

Here's the picture for the second example:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
const double EPS = 1E-9;
struct pt {
  double x, y;
  pt() {}
  pt(double _x, double _y) {
    x = _x;
    y = _y;
  }
};
struct seg {
  pt p, q;
  int id;
  seg() {}
  seg(pt a, pt b, int i) {
    p = a;
    q = b;
    id = i;
  }
  double get_y(double x) const {
    if (abs(p.x - q.x) < EPS) return p.y;
    return p.y + (q.y - p.y) * (x - p.x) / (q.x - p.x);
  }
};
inline bool intersect1d(double l1, double r1, double l2, double r2) {
  if (l1 > r1) swap(l1, r1);
  if (l2 > r2) swap(l2, r2);
  return max(l1, l2) <= min(r1, r2) + EPS;
}
inline int vec(const pt& a, const pt& b, const pt& c) {
  double s = (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
  return abs(s) < EPS ? 0 : s > 0 ? +1 : -1;
}
bool intersect(const seg& a, const seg& b) {
  return intersect1d(a.p.x, a.q.x, b.p.x, b.q.x) &&
         intersect1d(a.p.y, a.q.y, b.p.y, b.q.y) &&
         vec(a.p, a.q, b.p) * vec(a.p, a.q, b.q) <= 0 &&
         vec(b.p, b.q, a.p) * vec(b.p, b.q, a.q) <= 0;
}
bool operator<(const seg& a, const seg& b) {
  double x = max(min(a.p.x, a.q.x), min(b.p.x, b.q.x));
  return a.get_y(x) < b.get_y(x) - EPS;
}
struct event {
  double x;
  int tp, id;
  event() {}
  event(double x, int tp, int id) : x(x), tp(tp), id(id) {}
  bool operator<(const event& e) const {
    if (abs(x - e.x) > EPS) return x < e.x;
    return tp > e.tp;
  }
};
set<seg> s;
vector<set<seg>::iterator> where;
inline set<seg>::iterator prev(set<seg>::iterator it) {
  return it == s.begin() ? s.end() : --it;
}
inline set<seg>::iterator next(set<seg>::iterator it) { return ++it; }
pair<int, int> findIntersection(const vector<seg>& a) {
  int n = (int)a.size();
  vector<event> e;
  for (int i = 0; i < n; ++i) {
    e.push_back(event(min(a[i].p.x, a[i].q.x), +1, i));
    e.push_back(event(max(a[i].p.x, a[i].q.x), -1, i));
  }
  sort(e.begin(), e.end());
  s.clear();
  where.resize(a.size());
  for (size_t i = 0; i < e.size(); ++i) {
    int id = e[i].id;
    if (e[i].tp == +1) {
      set<seg>::iterator nxt = s.lower_bound(a[id]), prv = prev(nxt);
      if (nxt != s.end() && intersect(*nxt, a[id]))
        return make_pair(nxt->id, id);
      if (prv != s.end() && intersect(*prv, a[id]))
        return make_pair(prv->id, id);
      where[id] = s.insert(nxt, a[id]);
    } else {
      set<seg>::iterator nxt = next(where[id]), prv = prev(where[id]);
      if (nxt != s.end() && prv != s.end() && intersect(*nxt, *prv))
        return make_pair(prv->id, nxt->id);
      s.erase(where[id]);
    }
  }
  return make_pair(-1, -1);
}
int ar[25555][5];
vector<seg> vc;
double pp[25555][4];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n = 4;
  cin >> n;
  for (int i = (0); i < (n); ++i)
    for (int j = (0); j < (5); ++j) cin >> ar[i][j];
  for (int i = (0); i < (n); ++i) {
    pp[i][0] = ar[i][0];
    pp[i][1] = ar[i][1];
    double d = hypot(ar[i][2], ar[i][3]);
    pp[i][2] = (double)ar[i][2] * (double)ar[i][4] / d;
    pp[i][3] = (double)ar[i][3] * (double)ar[i][4] / d;
  }
  double lo = 0, hi = 1e14;
  for (int i = (0); i < (70); ++i) {
    double t = (lo + hi) / 2.0;
    vc.clear();
    for (int i = (0); i < (n); ++i) {
      vc.push_back(seg(pt(pp[i][0], pp[i][1]),
                       pt(pp[i][0] + t * pp[i][2], pp[i][1] + t * pp[i][3]),
                       i));
    }
    pair<int, int> p = findIntersection(vc);
    if (p.first == -1)
      lo = t;
    else
      hi = t;
  }
  if (lo > 1e13)
    cout << "No show :(" << endl;
  else
    cout << fixed << setprecision(12) << lo << endl;
}