{"extraResources":{"example.01.mu":"TVXzATQNCjAgMA0KMyA0DQo4IDENCjEgMQ0K"},"scoring":null,"notes":"","legend":"There are unicorns living in a magical kingdom on a plane.\r\nPeople know the coordinates of $n$ points on the map: the places of unicorn sightings.\r\n\r\nRecently, the king agreed to declare the territory inhabited by unicorns a nature reserve.\r\nThe boundaries of the reserve should be two parallel lines that will contain all $n$ places of unicorn sightings between them (or on them).\r\nHowever, land in the kingdom is expensive, so the king does not want to allocate anything extra for the reserve: each boundary must pass through at least one of the $n$ points.\r\n\r\nYou are the chief ecologist of the kingdom.\r\nYour task is to choose the boundaries of the reserve so that the king's will is fulfilled, but the reserve is as large as possible.\r\nThe size of the reserve is defined as the distance between the boundaries.\r\n","authorLogin":"nastya0001","language":"english","timeLimit":1000,"output":"We will define a line by three coefficients: $a$, $b$, and $c$.\r\nSuch a line contains points $(x, y)$ that satisfy the equation $a x + b y + c = 0$.\r\n\r\nOutput two lines specifying the borders.\r\nOn each line, print three integers: $a$, $b$, and $c$, the coefficients of a line equation ($|a|, |b|, |c| \\le 10^9$).\r\n\r\nThe distance between the lines must be the maximum possible.\r\nIt can be shown that there exists an optimal answer that satisfies the above constraints.\r\nIf there are several optimal answers, print any one of them.\r\n","inputFile":"stdin","outputFile":"stdout","input":"The first line contains an integer $n$: the number of places unicorn sightings ($2 \\le n \\le 1000$).\r\n\r\nEach of the following $n$ lines contains two integers $x$ and $y$: the coordinates of a point on the map where unicorns have been seen ($0 \\le x, y \\le 10^4$).\r\nAll given points are distinct.\r\n","authorName":"Nastya Gomera","sampleTests":[{"output":"8 1 0\r\n8 1 -65\r\n","input":"4\r\n0 0\r\n3 4\r\n8 1\r\n1 1\r\n","inputFile":"example.01","outputFile":"example.01.a"}],"name":"Nature Reserve","interaction":null,"memoryLimit":1073741824,"tutorial":""}