#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

#define N 20

const double eps=1e-;

struct Point

{

    int x, y;

};

struct node

{

    Point a;

    Point b;

}P[N];

int G[N][N], n;

/**--------- 判断两线段相交 模板 ------------**/

int Judge(int x, int y)

{

     Point a, b, c, d;

     a = P[x].a, b = P[x].b;

     c = P[y].a, d = P[y].b;

     if ( min(a.x, b.x) > max(c.x, d.x) ||

          min(a.y, b.y) > max(c.y, d.y) ||

          min(c.x, d.x) > max(a.x, b.x) ||

          min(c.y, d.y) > max(a.y, b.y) ) return ;

    double h, i, j, k;

    h = (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);

    i = (b.x - a.x) * (d.y - a.y) - (b.y - a.y) * (d.x - a.x);

    j = (d.x - c.x) * (a.y - c.y) - (d.y - c.y) * (a.x - c.x);

    k = (d.x - c.x) * (b.y - c.y) - (d.y - c.y) * (b.x - c.x);

    return h * i <= eps && j * k <= eps;

}

void Slove()

{

    int i, j, k;

    for(i=; i<=n; i++)

    for(j=i+; j<=n; j++)

    {

        if(Judge(i, j))

            G[i][j] = G[j][i] = ;

    }

    for(k=; k<=n; k++)

    for(i=; i<=n; i++)

    for(j=; j<=n; j++)

    {

        if(G[i][k] && G[k][j])

            G[i][j] = ;

    }

}

int main()

{

    while(scanf("%d", &n), n)

    {

        int i, u, v;

        for(i=; i<=n; i++)

            scanf("%d%d%d%d", &P[i].a.x, &P[i].a.y, &P[i].b.x, &P[i].b.y);

        memset(G, , sizeof(G));

        Slove();

        while(scanf("%d%d", &u, &v), u+v)

        {

            if(G[u][v] || u==v) printf("CONNECTED\n");

            else        printf("NOT CONNECTED \n");

        }

    }

    return ;

}