{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eBirthday cake was very good, tender coffee cake with layers of cream, \u001cfilled with white chocolate - a miracle of culinary art. But there is a problem: cake is shaped like a prism whose base is the regular \u003cstrong\u003eN\u003c/strong\u003e-angled polygon - just as the number of guests, and arrival of Sasha complicated the situation. Now, the cake should be divided into \u003cstrong\u003eN+1\u003c/strong\u003e part.\u003c/p\u003e\n\n\u003cp\u003e--- \u003cem\u003eWho of us likes geometry? \u003c/em\u003e --- \u003cem\u003eWell, you studied at math faculty, didn\u0027t you?. \u003c/em\u003e --- \u003cem\u003eAmazing arrogance. You\u0027re to blame\u003c/em\u003e - \u003cem\u003eand you are gonna take the knife. \u003c/em\u003e --- \u003cem\u003eThen, I propose to make vertical cuts. \u003c/em\u003e --- \u003cem\u003eWell, you\u0027re right, Captain Obvious. \u003c/em\u003e --- \u003cem\u003eIt\u0027s not all. Divide evenly on the \u003c/em\u003e\u003cstrong\u003eN+1\u003c/strong\u003e\u003cem\u003e parts so that the volumes of all pieces of the same. \u003c/em\u003e --- \u003cem\u003eWell, ok. \u003c/em\u003e --- \u003cem\u003eIt\u0027s still not all. Divide so that the surface area, fi\u001clled with chocolate,on all the pieces, was the same. \u003c/em\u003e --- \u003cem\u003eIt was easier to cut on my own.\u003c/em\u003e\u003c/p\u003e\n\n\u003cp\u003eWe consider the projection of the cake on the table. It turns a regular polygon centered at \u003cstrong\u003e(0, 0)\u003c/strong\u003e with one vertex at the point \u003cstrong\u003e(1, 0)\u003c/strong\u003e. The required pieces must be convex polygons such that no three vertices of a piece lie on a straight line. The plan must satisfy the cutting conditions, regardless of the height of the cake. Recall that the chocolate is only on the outer surface of the cake, meaning the upper and side faces.\u003c/p\u003e\n\n\u003cp\u003e\u003ch2\u003eInput\u003c/h2\u003e\u003c/p\u003e\n\n\u003cp\u003eThe number \u003cstrong\u003eN\u003c/strong\u003e (\u003cstrong\u003e3\u003c/strong\u003e ≤ \u003cstrong\u003eN\u003c/strong\u003e ≤ \u003cstrong\u003e100\u003c/strong\u003e) --- the number of guests except for Sasha.\u003c/p\u003e\n\n\u003cp\u003e\u003ch2\u003eOutput\u003c/h2\u003e\u003c/p\u003e\n\n\u003cp\u003ePrint exactly \u003cstrong\u003eN+1\u003c/strong\u003e block, each of which describes a single piece. The description of a piece begins with \u003cstrong\u003eK_i\u003c/strong\u003e (\u003cstrong\u003e3\u003c/strong\u003e ≤ \u003cstrong\u003eK_i\u003c/strong\u003e ≤ \u003cstrong\u003e100\u003c/strong\u003e) --- number of vertices. In the next \u003cstrong\u003eK_i\u003c/strong\u003e lines, print vertices in the anti-clockwise order, one vertex per line, with possible inaccuracy not greater than \u003cstrong\u003e10^\\{-8\\\u003c/strong\u003e}.\u003c/p\u003e\n\n"}},{"title":"Example","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\n0.0000000000000 0.0000000000000\n1.0000000000000 0.0000000000000\n-0.1250000000000 0.6495190528383\n4\n0.0000000000000 0.0000000000000\n-0.1250000000000 0.6495190528383\n-0.5000000000000 0.8660254037844\n-0.5000000000000 0.0000000000000\n4\n0.0000000000000 0.0000000000000\n-0.5000000000000 0.0000000000000\n-0.5000000000000 -0.8660254037844\n-0.1250000000000 -0.6495190528383\n3\n0.0000000000000 0.0000000000000\n-0.1250000000000 -0.6495190528383\n1.0000000000000 -0.0000000000000\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}