/************************************************
* Author        :Running_Time
* Created Time  :2015/10/26 星期一 15:37:36
* File Name     :POJ_2653.cpp************************************************/#include <cstdio>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <cstdlib>
#include <ctime>
using namespace std;#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
typedef long long ll;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos (-1.0);
int dcmp(double x)  {       //三态函数，减少精度问题if (fabs (x) < EPS) return 0;else    return x < 0 ? -1 : 1;
}
struct Point    {       //点的定义double x, y;Point (double x=0, double y=0) : x (x), y (y) {}Point operator + (const Point &r) const {       //向量加法return Point (x + r.x, y + r.y);}Point operator - (const Point &r) const {       //向量减法return Point (x - r.x, y - r.y);}Point operator * (double p)  {       //向量乘以标量return Point (x * p, y * p);}Point operator / (double p)  {       //向量除以标量return Point (x / p, y / p);}bool operator < (const Point &r) const {       //点的坐标排序return x < r.x || (x == r.x && y < r.y);}bool operator == (const Point &r) const {       //判断同一个点return dcmp (x - r.x) == 0 && dcmp (y - r.y) == 0;}
};
typedef Point Vector;       //向量的定义
Point read_point(void)   {      //点的读入double x, y;scanf ("%lf%lf", &x, &y);return Point (x, y);
}
double dot(Vector A, Vector B)  {       //向量点积return A.x * B.x + A.y * B.y;
}
double cross(Vector A, Vector B)    {       //向量叉积return A.x * B.y - A.y * B.x;
}
double polar_angle(Vector A)  {     //向量极角return atan2 (A.y, A.x);
}
double length(Vector A) {       //向量长度，点积return sqrt (dot (A, A));
}
double angle(Vector A, Vector B)    {       //向量转角，逆时针，点积return acos (dot (A, B) / length (A) / length (B));
}
Vector rotate(Vector A, double rad) {       //向量旋转，逆时针return Vector (A.x * cos (rad) - A.y * sin (rad), A.x * sin (rad) + A.y * cos (rad));
}
Vector nomal(Vector A)  {       //向量的单位法向量double len = length (A);return Vector (-A.y / len, A.x / len);
}
Point line_line_inter(Point p, Vector V, Point q, Vector W)    {        //两直线交点，参数方程Vector U = p - q;double t = cross (W, U) / cross (V, W);return p + V * t;
}
double point_to_line(Point p, Point a, Point b)   {       //点到直线的距离，两点式Vector V1 = b - a, V2 = p - a;return fabs (cross (V1, V2)) / length (V1);
}
double point_to_seg(Point p, Point a, Point b)    {       //点到线段的距离，两点式if (a == b) return length (p - a);Vector V1 = b - a, V2 = p - a, V3 = p - b;if (dcmp (dot (V1, V2)) < 0)    return length (V2);else if (dcmp (dot (V1, V3)) > 0)   return length (V3);else    return fabs (cross (V1, V2)) / length (V1);
}
Point point_line_proj(Point p, Point a, Point b)   {     //点在直线上的投影，两点式Vector V = b - a;return a + V * (dot (V, p - a) / dot (V, V));
}
bool can_inter(Point a1, Point a2, Point b1, Point b2)  {       //判断线段相交，两点式double c1 = cross (a2 - a1, b1 - a1), c2 = cross (a2 - a1, b2 - a1),c3 = cross (b2 - b1, a1 - b1), c4 = cross (b2 - b1, a2 - b1);return dcmp (c1) * dcmp (c2) < 0 && dcmp (c3) * dcmp (c4) < 0;
}
bool on_seg(Point p, Point a1, Point a2)    {       //判断点在线段上，两点式return dcmp (cross (a1 - p, a2 - p)) == 0 && dcmp (dot (a1 - p, a2 - p)) < 0;
}
double area_triangle(Point a, Point b, Point c) {       //三角形面积，叉积return fabs (cross (b - a, c - a)) / 2.0;
}
double area_poly(Point *p, int n)   {       //多边形面积，叉积double ret = 0;for (int i=1; i<n-1; ++i)   {ret += fabs (cross (p[i] - p[0], p[i+1] - p[0]));}return ret / 2;
}
/*点集凸包
*/
vector<Point> convex_hull(vector<Point> &P) {sort (P.begin (), P.end ());int n = P.size (), k = 0;vector<Point> ret (n * 2);for (int i=0; i<n; ++i) {while (k > 1 && cross (ret[k-1] - ret[k-2], P[i] - ret[k-1]) <= 0)  k--;ret[k++] = P[i];}for (int i=n-2, t=k; i>=0; --i)  {while (k > t && cross (ret[k-1] - ret[k-2], P[i] - ret[k-1]) <= 0)  k--;ret[k++] = P[i];}ret.resize (k-1);return ret;
}struct Circle   {Point c;double r;Circle () {}Circle (Point c, double r) : c (c), r (r) {}Point point(double a)   {return Point (c.x + cos (a) * r, c.y + sin (a) * r);}
};
struct Line {Point p;Vector v;double r;Line () {}Line (const Point &p, const Vector &v) : p (p), v (v) {r = polar_angle (v);}Point point(double a)   {return p + v * a;}
};Point s[N], e[N];
bool vis[N];int main(void)    {int n;while (scanf ("%d", &n) == 1)   {if (!n) break;memset (vis, true, sizeof (vis));for (int i=1; i<=n; ++i)    {s[i] = read_point ();e[i] = read_point ();}queue<int> Q;   Q.push (1);for (int i=2; i<=n; ++i)    {Q.push (i);while (!Q.empty ()) {if (i == Q.front ())    break;int j = Q.front (); Q.pop ();if (can_inter (s[i], e[i], s[j], e[j])) {vis[j] = false;}else    Q.push (j);}}printf ("Top sticks: ");bool fir = true;for (int i=1; i<=n; ++i)    {if (vis[i]) {if (fir)    {printf ("%d", i);   fir = false;}else    {printf (", %d", i);}}}puts (".");}//cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";return 0;
}