#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-12;
struct pt {
  long double x, y;
  pt() : x(0), y(0) {}
  pt(long double a, long double b) : x(a), y(b) {}
};
struct seg {
  pt p, q;
  int id;
  long double get_y(long 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);
  }
};
bool intersect1d(long double l1, long double r1, long double l2,
                 long double r2) {
  if (l1 > r1) swap(l1, r1);
  if (l2 > r2) swap(l2, r2);
  return max(l1, l2) <= min(r1, r2) + EPS;
}
int vec(const pt& a, const pt& b, const pt& c) {
  long 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) <= EPS &&
         vec(b.p, b.q, a.p) * vec(b.p, b.q, a.q) <= EPS;
}
bool operator<(const seg& a, const seg& b) {
  long 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 {
  long double x;
  int tp, id;
  event() {}
  event(long 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;
  }
};
multiset<seg> s;
vector<multiset<seg>::iterator> where;
multiset<seg>::iterator prev(multiset<seg>::iterator it) {
  return it == s.begin() ? s.end() : --it;
}
multiset<seg>::iterator next(multiset<seg>::iterator it) { return ++it; }
pair<int, int> solve(const vector<seg>& a) {
  s = std::multiset<seg>();
  where = std::vector<std::multiset<seg>::iterator>();
  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) {
      multiset<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 {
      multiset<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);
}
struct S {
  pt pos, vec;
  long double speed;
};
pt operator+(pt a, pt b) { return pt(a.x + b.x, a.y + b.y); }
std::vector<S> A;
bool hehhe(long double len) {
  std::vector<seg> siema;
  int ind = 0;
  for (auto& a : (A)) {
    pt start = a.pos;
    pt mv = a.vec;
    mv.x *= len * a.speed;
    mv.y *= len * a.speed;
    seg ss;
    ss.p = start;
    ss.q = start + mv;
    ss.id = ind++;
    siema.push_back(ss);
  }
  if (solve(siema).first != -1) return true;
  return false;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
  int n;
  std::cin >> n;
  if (n == 1) {
    std::cout << "No show :(\n";
    return 0;
  }
  A.resize(n);
  for (int i = 0; i < (n); ++i) {
    int x, y, dx, dy, ss;
    std::cin >> x >> y >> dx >> dy >> ss;
    A[i].pos = pt(x, y);
    long double len = (long double)dx * dx + (long double)dy * dy;
    A[i].vec =
        pt((long double)dx / std::sqrt(len), (long double)dy / std::sqrt(len));
    A[i].speed = ss;
  }
  long double left = 0;
  long double right = 1e10;
  for (int i = 0; i < (100); ++i) {
    long double mid = (left + right) / 2;
    if (hehhe(mid))
      right = mid;
    else
      left = mid;
  }
  if (!hehhe(right + 0.1))
    std::cout << "No show :(\n";
  else
    std::cout << std::fixed << std::setprecision(12) << (left + right) / 2
              << "\n";
  return 0;
}
