#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 62;
int iinf = 1 << 30;
double pi = 3.141592653589793238462643383279L;
double eps = 1e-8;
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  if (k < 0) return 0;
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long popcount(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
pair<double, double> ff(double a, double b, double c, double d, double e,
                        double f) {
  if (abs(b * d - a * e) <= eps) return {1000000000, 1000000000};
  double rx = (c * e - b * f) / (b * d - a * e);
  double ry = (a * f - c * d) / (b * d - a * e);
  return {rx, ry};
}
int main() {
  int n;
  cin >> n;
  double x[n], y[n], dx[n], dy[n], s[n];
  for (int i = 0; i < n; i++)
    scanf("%lf %lf %lf %lf %lf", &x[i], &y[i], &dx[i], &dy[i], &s[i]);
  double ans = 100000000000000;
  double a[n], b[n], c[n];
  for (int i = 0; i < n; i++) {
    a[i] = -dy[i];
    b[i] = dx[i];
    c[i] = x[i] * dy[i] - dx[i] * y[i];
    if (a[i] < 0) {
      a[i] = -a[i];
      b[i] = -b[i];
      c[i] = -c[i];
    }
  }
  double d;
  pair<double, double> p;
  double ssi, ssj;
  for (int i = 0; i < n - 1; i++) {
    for (int j = i + 1; j < n; j++) {
      p = ff(a[i], b[i], c[i], a[j], b[j], c[j]);
      if (p.first == 1000000000) {
        if (c[i] == c[j]) {
          d = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
          if (dx[i] * dx[j] > 0) {
            if (dx[i] > 0) {
              if (x[i] < x[j])
                d /= s[i] * s[i];
              else
                d /= s[j] * s[j];
            } else {
              if (x[i] > x[j])
                d /= s[i] * s[i];
              else
                d /= s[j] * s[j];
            }
            ans = min(ans, sqrt(d));
          } else {
            if (dx[i] > 0) {
              if (x[i] > x[j]) continue;
            } else {
              if (x[i] < x[j]) continue;
            }
            d /= (s[i] + s[j]) * (s[i] + s[j]);
            ans = min(ans, sqrt(d));
          }
        }
        continue;
      }
      ssi = (p.first - x[i]);
      ssj = (p.first - x[j]);
      if (dx[i] * ssi < 0 || dx[j] * ssj < 0) continue;
      ssi = (p.first - x[i]) * (p.first - x[i]) +
            (p.second - y[i]) * (p.second - y[i]);
      ssj = (p.first - x[j]) * (p.first - x[j]) +
            (p.second - y[j]) * (p.second - y[j]);
      ssi /= s[i] * s[i];
      ssj /= s[j] * s[j];
      ans = min(ans, max(sqrt(ssi), sqrt(ssj)));
    }
  }
  if (abs(ans - 100000000000000) < eps)
    cout << "No show :(" << endl;
  else {
    cout << fixed << setprecision(15) << ans << endl;
  }
}
