B"You've got a robot, its task is destroying bombs on a square plane. Specifically, the square plane contains n bombs, the i-th bomb is at point with coordinates (xi, xe2 x80 x89yi). We know that no two bombs are at the same point and that no bomb is at point with coordinates (0, xe2 x80 x890). Initially, the robot is at point with coordinates (0, xe2 x80 x890). Also, let's mark the robot's current position as (x, xe2 x80 x89y). In order to destroy all the bombs, the robot can perform three types of operations: Help the robot and find the shortest possible sequence of operations he can perform to destroy all bombs on the coordinate plane. The first line contains a single integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the number of bombs on the coordinate plane. Next n lines contain two integers each. The i-th line contains numbers (xi, xe2 x80 x89yi) ( xe2 x80 x89- xe2 x80 x89109 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89xi, xe2 x80 x89yi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the coordinates of the i-th bomb. It is guaranteed that no two bombs are located at the same point and no bomb is at point (0, xe2 x80 x890). In a single line print a single integer k -- the minimum number of operations needed to destroy all bombs. On the next lines print the descriptions of these k operations. If there are multiple sequences, you can print any of them. It is guaranteed that there is the solution where k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106."...