B'On the surface of a newly discovered planet, which we model by a plane, explorers found remains of two different civilizations in various locations. They would like to learn more about those civilizations and to explore the area they need to build roads between some of locations. But as always, there are some restrictions: Obviously all locations are different points in the plane, but explorers found out one more interesting information that may help you xe2 x80 x93 no three locations lie on the same line! Help explorers and find a solution for their problem, or report it is impossible. In the first line, integer n (1 <= q n <= q 10^3) - the number of locations discovered. In next n lines, three integers x, y, c (0 <= q x, y <= q 10^4, c in {0, 1 }) - coordinates of the location and number of civilization it belongs to. In first line print number of roads that should be built. In the following lines print all pairs of locations (their 0 -based indices) that should be connected with a road. If it is not possible to build roads such that all restrictions are met, print "Impossible". You should not print the quotation marks. '...