B'You are given a piece of paper in the shape of a simple polygon S . Your task is to turn it into a simple polygon T that has the same area as S . You can use two tools: scissors and tape. Scissors can be used to cut any polygon into smaller polygonal pieces. Tape can be used to combine smaller pieces into larger polygons. You can use each tool multiple times, in any order. The polygons given in the input have integer coordinates, but you are allowed to produce shapes with non-integer coordinates in your output. A formal definition of the task follows. A shape Q=(Q_0, ... ,Q_{n-1}) is a sequence of three or more points in the plane such that: The polygon whose boundary is the shape Q will be denoted P(Q) . Two shapes are called equivalent if one can be translated and/or rotated to become identical with the other. Note that mirroring a shape is not allowed. Also note that the order of points matters: the shape (Q_1, ... ,Q_{n-1},Q_0) is not necessarily equivalent to the shape (Q_0, ... ,Q_{n-1}) . In the figure on the left: Shapes U and V are equivalent. Shape W is not equivalent with them because the points of W are given in a different order. Regardless of the order of points, the fourth shape is not equivalent with the previous ones either as flipping a shape is not allowed. In both input and output, a shape with n points is represented as a single line that contains 2n+1 space-separated numbers: the number n followed by the coordinates of the points: Q_{0,x} , Q_{0,y} , Q_{1,x} , ... Shapes have identification numbers (IDs). The given shape S has ID 0, the shapes you produce in your solutions are given IDs 1, 2, 3, ..., in the order in which they are produced. Shapes B_1, ... ,B_k form a subdivision of shape A if: The scissors operation destroys one existing shape A and produces one or more shapes B_1, ... ,B_k that form '...