#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cstdlib>

#include<cmath>

#include<iostream>

using namespace std;

typedef long long ll;

const double eps=1e-;

int sgn(double x){

    if(fabs(x)<eps)return ;

    else if(x<) return -;

    else return ;

}

struct Point{

    double x,y;

    Point(){}

    Point(double _x,double _y){x=_x;y=_y;}

    Point operator-(const Point &b)const{return Point(x - b.x,y - b.y);}

    double operator^(const Point &b)const{return x*b.y-y*b.x;}

    double operator*(const Point &b)const{return x*b.x+y*b.y;}

};

struct Line{

    Point s,e;

    Line(){}

    Line(Point _s,Point _e){s=_s;e=_e;}

};

//判断线段相交，模板

bool inter(Line l1,Line l2){

    return

        max(l1.s.x,l1.e.x)>=min(l2.s.x,l2.e.x)&&

        max(l2.s.x,l2.e.x)>=min(l1.s.x,l1.e.x)&&

        max(l1.s.y,l1.e.y)>=min(l2.s.y,l2.e.y)&&

        max(l2.s.y,l2.e.y)>=min(l1.s.y,l1.e.y)&&

        sgn((l2.s-l1.s)^(l1.e-l1.s))*sgn((l2.e-l1.s)^(l1.e-l1.s))<=&&

        sgn((l1.s-l2.s)^(l2.e-l2.s))*sgn((l1.e-l2.s)^(l2.e-l2.s))<=;

} 

const int MAXN=;

Line line[MAXN];

bool flag[MAXN];

int main(){

    int n;

    double x1,y1,x2,y2;

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

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

            scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);

            line[i]=Line(Point(x1,y1),Point(x2,y2));

            flag[i]=true;

        }

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

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

                if(inter(line[i],line[j])){

                    flag[i]=false;

                    break;

                }

        }

        printf("Top sticks: ");

        bool first=true;

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

            if(flag[i]){//只是为了控制格式

                if(first)first=false;

                else printf(", ");

                printf("%d",i);

            }

        printf(".\n");

    }

    return ;

}