#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <map>
#include <queue>
using namespace std;
const double EPS = 1e-10;
const double INF = 1e12;
const double PI = acos(-1);
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()

typedef complex<double> P;
typedef vector<P> VP;
struct L : array<P, 2>{
    L(const P& a, const P& b){ at(0)=a; at(1)=b; }
    L(){}
};
namespace std{
    bool operator < (const P& a, const P& b){
        return !EQ(a.X,b.X)? a.X<b.X : a.Y+EPS<b.Y;
    }
    bool operator == (const P& a, const P& b){
        return abs(a-b) < EPS;
    }
}
double dot(P a, P b){
    return (conj(a)*b).X;
}
double cross(P a, P b){
    return (conj(a)*b).Y;
}
int ccw(P a, P b, P c){
    b -= a;
    c -= a;
    if(cross(b,c) > EPS) return +1; //ccw
    if(cross(b,c) < -EPS) return -1; //cw
    if(dot(b,c) < -EPS) return +2; //c-a-b
    if(abs(c)-abs(b) > EPS) return -2; //a-b-c
    return 0; //a-c-b
}

bool intersectSP(const L& s, const P &p){
    return abs(cross(s[0]-p, s[1]-p))<EPS  && dot(s[0]-p, s[1]-p)<EPS;
}
bool intersectSS(const L& a, const L& b){
    return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&
        ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );
}

bool isParallel(const P &a, const P &b){
    return abs(cross(a,b)) < EPS;
}
bool isParallel(const L &a, const L &b){
    return isParallel(a[1]-a[0], b[1]-b[0]);
}

P crosspointLL(const L &l, const L &m) {
  double A = cross(l[1]-l[0], m[1]-m[0]);
  double B = cross(l[1]-l[0], l[1]-m[0]);
  return m[0] + B/A *(m[1]-m[0]);
}

double getangle(P a, P b){
    return abs(arg(a/b));
}

//比較関数は誤差許容にすること（死ぬので）
pair<vector<vector<int> >, VP> arrangement(const vector<L> &l){
    vector<VP> cp(l.size());
    VP plist;
    for(int i=0; i<(int)l.size(); i++){
        for(int j=i+1; j<(int)l.size(); j++){
            if(!isParallel(l[i], l[j]) && intersectSS(l[i], l[j])){
                P cpij = crosspointLL(l[i], l[j]);
                cp[i].push_back(cpij);
                cp[j].push_back(cpij);
                plist.push_back(cpij);
            }
        }
        cp[i].push_back(l[i][0]);
        cp[i].push_back(l[i][1]);
        plist.push_back(l[i][0]);
        plist.push_back(l[i][1]);
        sort(cp[i].begin(), cp[i].end());
        cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());
    }
    sort(plist.begin(), plist.end());
    plist.erase(unique(plist.begin(), plist.end()), plist.end());

    int n = plist.size();
    map<P, int> conv;
    for(int i=0; i<n; i++){
        conv[plist[i]] = i;
    }
    vector<vector<int> > adj(n);
    for(int i=0; i<(int)cp.size(); i++){
        for(int j=0; j<(int)cp[i].size()-1; j++){
            int jidx = conv[cp[i][j]];
            int jp1idx = conv[cp[i][j+1]];
            adj[jidx].push_back(jp1idx);
            adj[jp1idx].push_back(jidx);
        }
    }
    for(int i=0; i<n; i++){
        sort(adj[i].begin(), adj[i].end());
        adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());
    }
    return make_pair(adj, plist);
}

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

        //input
        double sx,sy,gx,gy;
        cin >> sx >> sy >> gx >> gy;
        P s(sx, sy), g(gx, gy);
        vector<L> lines(n);
        for(int i=0; i<n; i++){
            cin >> sx >> sy >> gx >> gy;
            lines[i] = L(P(sx, sy), P(gx, gy));
        }

        //道路か標識か
        vector<L> road, mark;
        for(int i=0; i<n; i++){
            bool isroad[2] = {false, false};
            for(int j=0; j<n; j++){
                if(i==j) continue;
                for(int d=0; d<2; d++){
                    if(intersectSP(lines[j], lines[i][d])){
                        isroad[d] = true;
                    }
                }
            }
            if(isroad[0] && isroad[1]){
                road.push_back(lines[i]);
            }else{
                mark.push_back(lines[i]);
            }
        }

        //アレンジメントにかけて、標識で制限をかける
        auto ret = arrangement(road);
        vector<vector<int> > &adj = ret.first;
        VP &plist = ret.second;
        int pnum = plist.size();
        for(int i=0; i<(int)adj.size(); i++){
            for(int j=adj[i].size()-1; j>=0; j--){
                L edge(plist[i], plist[adj[i][j]]);
                for(int k=0; k<(int)mark.size(); k++){
                    if(!intersectSS(edge, mark[k])) continue;
                    if(!intersectSP(edge, mark[k][0])){
                        swap(mark[k][0], mark[k][1]);
                    }
                    if(abs(getangle(plist[i] -mark[k][0], mark[k][1] -mark[k][0])) +EPS > PI/2){
                        adj[i].erase(adj[i].begin() +j);
                        break;
                    }
                }
            }
        }

        //ダイクストラ
        int sidx=-1, gidx=-1;
        for(int i=0; i<pnum; i++){
            if(plist[i] == s) sidx = i;
            if(plist[i] == g) gidx = i;
        }
        vector<double> mindist(pnum, INF);
        vector<int> prev(pnum);
        priority_queue<pair<double, int> > wait;
        mindist[sidx] = 0;
        wait.push(make_pair(0, sidx));
        while(!wait.empty()){
            double dist = -wait.top().first;
            int pos = wait.top().second;
            wait.pop();
            if(dist > mindist[pos] +EPS) continue;
            for(int npos: adj[pos]){
                double ndist = dist + abs(plist[pos] -plist[npos]);
                if(ndist +EPS < mindist[npos]){
                    mindist[npos] = ndist;
                    prev[npos] = pos;
                    wait.push(make_pair(-ndist, npos));
                }
            }
        }

        if(mindist[gidx] == INF){
            cout << -1 << endl;
        }else{
            vector<int> his(1, gidx);
            int now = gidx;
            while(now != sidx){
                int next = prev[now];
                his.push_back(next);
                now = next;
            }
            reverse(his.begin(), his.end());
            cout << fixed << setprecision(0);
            for(int i=0; i<(int)his.size(); i++){
                cout << plist[his[i]].X << " " << plist[his[i]].Y << endl;
            }
            cout << 0 << endl;
        }
    }
    return 0;
}


Measured memory_bytes: 3580