#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    
    std::vector<int> x1(n), y1(n), x2(n), y2(n);
    std::vector<int> vx, vy;
    vx.reserve(n + 2);
    vy.reserve(n + 2);
    for (int i = 0; i < n; i++) {
        std::cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
        if (x1[i] == x2[i]) {
            vx.push_back(x1[i]);
        } else {
            vy.push_back(y1[i]);
        }
    }
    
    int sx, sy, tx, ty;
    std::cin >> sx >> sy >> tx >> ty;
    
    vx.push_back(sx);
    vy.push_back(sy);
    vx.push_back(tx);
    vy.push_back(ty);
    
    if (sx == tx && sy == ty) {
        std::cout << 0 << "\n";
        return 0;
    }
    
    std::sort(vx.begin(), vx.end());
    std::sort(vy.begin(), vy.end());
    vx.erase(std::unique(vx.begin(), vx.end()), vx.end());
    vy.erase(std::unique(vy.begin(), vy.end()), vy.end());
    
    const int nx = vx.size();
    const int ny = vy.size();
    for (int i = 0; i < n; i++) {
        if (x1[i] > x2[i]) {
            std::swap(x1[i], x2[i]);
        }
        if (y1[i] > y2[i]) {
            std::swap(y1[i], y2[i]);
        }
        x1[i] = std::lower_bound(vx.begin(), vx.end(), x1[i]) - vx.begin();
        y1[i] = std::lower_bound(vy.begin(), vy.end(), y1[i]) - vy.begin();
        x2[i] = std::lower_bound(vx.begin(), vx.end(), x2[i] + 1) - vx.begin() - 1;
        y2[i] = std::lower_bound(vy.begin(), vy.end(), y2[i] + 1) - vy.begin() - 1;
    }
    
    sx = std::lower_bound(vx.begin(), vx.end(), sx) - vx.begin();
    sy = std::lower_bound(vy.begin(), vy.end(), sy) - vy.begin();
    tx = std::lower_bound(vx.begin(), vx.end(), tx) - vx.begin();
    ty = std::lower_bound(vy.begin(), vy.end(), ty) - vy.begin();
    
    std::map<std::array<int, 2>, int> id;
    std::vector<std::array<int, 2>> ver;
    std::vector<std::vector<int>> px(nx), py(ny);
    std::vector<std::vector<std::array<int, 2>>> segx(nx), segy(ny);
    auto find = [&](auto &a, int x) {
        auto it = std::lower_bound(a.begin(), a.end(), std::array{x + 1, 0});
        if (it == a.begin()) {
            return false;
        }
        it--;
        return (*it)[1] >= x;
    };
    
    auto add = [&](int x, int y) {
        if (id.count({x, y})) {
            return;
        }
        if (!find(segx[x], y) && !find(segy[y], x)) {
            return;
        }
        int u = id[{x, y}] = ver.size();
        ver.push_back({x, y});
        px[x].push_back(u);
        py[y].push_back(u);
    };
    
    for (int i = 0; i < n; i++) {
        if (x1[i] == x2[i]) {
            if (y1[i] > y2[i]) {
                continue;
            }
            add(x1[i], y1[i]);
            add(x2[i], y2[i]);
            segx[x1[i]].push_back({y1[i], y2[i]});
        } else {
            if (x1[i] > x2[i]) {
                continue;
            }
            add(x1[i], y1[i]);
            add(x2[i], y2[i]);
            segy[y1[i]].push_back({x1[i], x2[i]});
        }
    }
    
    for (int x = 0; x < nx; x++) {
        std::sort(segx[x].begin(), segx[x].end());
    }
    for (int y = 0; y < ny; y++) {
        std::sort(segy[y].begin(), segy[y].end());
    }
    
    std::vector<int> dx{0, nx - 1};
    constexpr int B = 100;
    for (int i = B; i < nx; i += B) {
        dx.push_back(i);
    }
    dx.push_back(sx);
    dx.push_back(tx);
    std::sort(dx.begin(), dx.end());
    dx.erase(std::unique(dx.begin(), dx.end()), dx.end());
    
    for (auto x : dx) {
        for (int y = 0; y < ny; y++) {
            add(x, y);
        }
    }
    
    for (int i = 0; i + 1 < dx.size(); i++) {
        int xl = dx[i], xr = dx[i + 1];
        
        std::vector<int> ys;
        bool first = true;
        for (int y = 0; y < ny; y++) {
            for (auto [l, r] : segy[y]) {
                if (r < xl || l > xr) {
                    continue;
                }
                if (l <= xl && r >= xr) {
                    ys.push_back(y);
                    if (first) {
                        for (int x = xl; x <= xr; x++) {
                            add(x, y);
                        }
                        first = false;
                    }
                } else {
                    for (int x = xl; x <= xr; x++) {
                        add(x, y);
                    }
                    if (!ys.empty()) {
                        for (int x = xl; x <= xr; x++) {
                            add(x, ys.back());
                        }
                    }
                    first = true;
                }
            }
        }
        if (!ys.empty()) {
            for (int x = xl; x <= xr; x++) {
                add(x, ys.back());
            }
        }
        
        std::set<int> h;
        for (auto y : ys) {
            h.insert(y);
        }
        for (int x = xl + 1; x < xr; x++) {
            for (auto [l, r] : segx[x]) {
                int j = std::lower_bound(ys.begin(), ys.end(), l) - ys.begin();
                int k = std::lower_bound(ys.begin(), ys.end(), r + 1) - ys.begin() - 1;
                if (j > k) {
                    continue;
                }
                l = ys[j];
                r = ys[k];
                add(x, l);
                add(x, r);
                auto it = h.lower_bound(l);
                while (it != h.end() && *it <= r) {
                    add(x, *it);
                    it = h.erase(it);
                }
                h.insert(l);
                h.insert(r);
            }
        }
        for (auto y : ys) {
            h.insert(y);
        }
        for (int x = xr - 1; x > xl; x--) {
            for (auto [l, r] : segx[x]) {
                int j = std::lower_bound(ys.begin(), ys.end(), l) - ys.begin();
                int k = std::lower_bound(ys.begin(), ys.end(), r + 1) - ys.begin() - 1;
                if (j > k) {
                    continue;
                }
                l = ys[j];
                r = ys[k];
                add(x, l);
                add(x, r);
                auto it = h.lower_bound(l);
                while (it != h.end() && *it <= r) {
                    add(x, *it);
                    it = h.erase(it);
                }
                h.insert(l);
                h.insert(r);
            }
        }
    }
    
    add(sx, sy);
    add(tx, ty);
    
    const int V = ver.size();
    std::vector<std::array<int, 4>> adj(V);
    std::vector<int> cnt(V);
    std::vector<i64> dis(V, -1);
    
    auto addEdge = [&](int u, int v) {
        adj[u][cnt[u]++] = v;
        adj[v][cnt[v]++] = u;
    };
    
    for (int x = 0; x < nx; x++) {
        int m = px[x].size();
        std::sort(px[x].begin(), px[x].end(),
            [&](int i, int j) {
                return ver[i][1] < ver[j][1];
            });
        for (int i = 0, j = 0; auto [l, r] : segx[x]) {
            while (i < m && ver[px[x][i]][1] < l) {
                i++;
            }
            while (j < m && ver[px[x][j]][1] <= r) {
                j++;
            }
            for (int k = i; k < j - 1; k++) {
                int u = px[x][k];
                int v = px[x][k + 1];
                addEdge(u, v);
            }
        }
    }
    
    for (int y = 0; y < ny; y++) {
        int m = py[y].size();
        std::sort(py[y].begin(), py[y].end(),
            [&](int i, int j) {
                return ver[i][0] < ver[j][0];
            });
        for (int i = 0, j = 0; auto [l, r] : segy[y]) {
            while (i < m && ver[py[y][i]][0] < l) {
                i++;
            }
            while (j < m && ver[py[y][j]][0] <= r) {
                j++;
            }
            for (int k = i; k < j - 1; k++) {
                int u = py[y][k];
                int v = py[y][k + 1];
                addEdge(u, v);
            }
        }
    }
    
    if (!id.count({sx, sy})) {
        std::cout << -1 << "\n";
        return 0;
    }
    if (!id.count({tx, ty})) {
        std::cout << -1 << "\n";
        return 0;
    }
    int S = id[{sx, sy}];
    int T = id[{tx, ty}];
    std::priority_queue<std::pair<i64, int>, std::vector<std::pair<i64, int>>, std::greater<>> q;
    q.emplace(0, S);
    dis[S] = 0;
    while (!q.empty()) {
        auto [d, x] = q.top();
        q.pop();
        
        if (dis[x] < d) {
            continue;
        }
        for (int i = 0; i < cnt[x]; i++) {
            int y = adj[x][i];
            int w = std::abs(vx[ver[x][0]] - vx[ver[y][0]]) + std::abs(vy[ver[x][1]] - vy[ver[y][1]]);
            if (dis[y] == -1 || dis[y] > d + w) {
                dis[y] = d + w;
                q.emplace(d + w, y);
            }
        }
    }
    
    std::cout << dis[T] << "\n";
    
    return 0;
}