#include <bits/stdc++.h>
using namespace std;
using LL = long long;

#define fs first
#define sc second

const LL MOD = 1e9+7;
const double EPS = 1e-10;

template<class T>bool chmax(T &a, const T &b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>bool chmin(T &a, const T &b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a,make_vector<T>(b,ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) {
        is >> e;
    }
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    operator int() const { return to; }

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using MatrixGraph = vector<vector<T>>;

typedef complex<double> Point;
typedef pair<Point, Point> LS;

double cross(const Point &a, const Point &b) {
    return a.real() * b.imag() - a.imag() * b.real();
}

double dot(const Point &a, const Point &b) {
    return a.real() * b.real() + a.imag() * b.imag();
}

int is_intersected_ls(
        const Point &a1, const Point &a2,
        const Point &b1, const Point &b2)
{
    return cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < EPS &&
        cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1) < EPS;
}

int is_parallel(
        const Point &a1, const Point &a2,
        const Point &b1, const Point &b2)
{
    return abs(cross(a1-a2, b1-b2)) < EPS;
}

double distance_l_p(const LS &ls, const Point &c) {
    Point a = ls.fs, b = ls.sc;
    if (dot(b-a, c-a) < EPS) return abs(c-a);
    if (dot(a-b, c-b) < EPS) return abs(c-b);
    return abs(cross(b-a, c-a)) / abs(b-a);
}

double ls_distance(const LS &a, const LS &b) {
    bool parallel = is_parallel(a.fs, a.sc, b.fs, b.sc);
    bool intersect = is_intersected_ls(a.fs, a.sc, b.fs, b.sc);

    if (!parallel && intersect) return 0;

    return min({distance_l_p(a, b.fs),
            distance_l_p(a, b.sc),
            distance_l_p(b, a.fs),
            distance_l_p(b, a.sc)});
}

int main()
{
    while (true) {
        int n; cin >> n;
        if (n == 0) {
            break;
        }

        Point s, e;
        {
            double sx, sy, ex, ey;
            cin >> sx >> sy >> ex >> ey;
            s = {sx, sy}; e = {ex, ey};
        }

        vector<array<Point,4>> rec(n);
        vector<double> l(n), b(n), r(n), t(n), h(n);
        for (int i = 0; i < n; ++i) {
            cin >> l[i] >> b[i] >> r[i] >> t[i] >> h[i];
            rec[i] = {{{l[i], b[i]}, {l[i], t[i]}, {r[i], t[i]}, {r[i], b[i]}}};
        }

        vector<double> dist(n, numeric_limits<double>::max());
        for (int i = 0; i < n; ++i) {

            if (l[i] < s.real() && s.real() < r[i] &&
                b[i] < s.imag() && s.imag() < t[i]) {
                dist[i] = 0;
                continue;
            }

            for (int k = 0; k < 4; ++k) {
                Point a = rec[i][k], b = rec[i][(k+1)%4];
                chmin(dist[i],
                        ls_distance(LS(a, b), LS(s, e)));
            }
        }

        double ans = numeric_limits<double>::max();
        for (int i = 0; i < n; ++i) {
            if (h[i] < dist[i]) {
                chmin(ans, (h[i]*h[i] + dist[i]*dist[i]) / (2*h[i]));
            } else {
                chmin(ans, dist[i]);
            }
        }

        printf("%.7lf\n", ans);
    }

    return 0;
}



Measured memory_bytes: 3272