#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
    for (auto &e: vec) {
        is >> e;
    }
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) {
        cout << " ";
    }
    output(forward<Tail>(tail)...);
}

template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e: vec) {
        os << e << delim[&e == &vec.back()];
    }
    return os;
}

template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

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

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

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}
// End Header }}}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    const int H = 100;
    const int W = 100;

    size_t N;
    while (cin >> N, N) {
        var(size_t, A, B, C, D);
        A--, B--, C--, D--;

        auto isOK = makeVector<bool>(0, H, W);
        rep(y, 0, H) rep(x, 0, W) {
            if (B <= y && y <= D && A <= x && x <= C) {
                isOK[y][x] = true;
            }
        }

        const int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
        const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};

        const auto inside = [](int y, int x, int H, int W) {
            return (y >= 0 && x >= 0 && y < H && x < W);
        };

        var(int, sx, sy);
        sy--, sx--;

        intmax_t res = 0;
        reps(i, 1, N) {
            var(int, gx, gy);
            gy--, gx--;

            MinHeap<tuple<intmax_t, int, int>> que;
            que.emplace(0, sy, sx);

            auto cost = makeVector<intmax_t>(INF, H, W);
            cost[sy][sx] = 0;

            while (!que.empty()) {
                intmax_t c;
                int y, x;
                tie(c, y, x) = que.top();
                que.pop();

                if (cost[y][x] < c) continue;

                rep(i, 0, 4) {
                    int ny = y + dy[i];
                    int nx = x + dx[i];
                    if (inside(ny, nx, H, W) && chmin(cost[ny][nx], cost[y][x] + !isOK[ny][nx])) {
                        que.emplace(cost[ny][nx], ny, nx);
                    }
                }
            }

            res += cost[gy][gx];
            sy = gy, sx = gx;
        }

        output(res);
    }

    return 0;
}



Measured memory_bytes: 3232