PROGRAMMING:Fruit ninja
In 2010, the "fruit ninja" game is popular all over the world. Surely everyone has played it（ It doesn't matter if you haven't played ~) in the game, a series of fruits and bombs will be ejected randomly from the screen. Players can cut off all fruits as much as possible to avoid hitting the bomb, and then they can complete the tasks specified in the game. If the player can chop down a series of fruits in the picture, there will be additional rewards, as shown in Figure 1.
**Figure 1**
Now if you are a "fruit ninja" game player, one of the things you have to do is to cut down the fruit in the picture. This problem seems a little complicated. Let's simplify it. We think of the game world as a two-dimensional plane. Each fruit in the game is simplified into a vertical line segment perpendicular to the horizontal line. We only consider whether we can find a straight line through all the lines representing the fruit.
**Figure 2**
As shown in Figure 2, the green vertical line segments represent the fruits one by one; The gray dotted line represents a straight line passing through all line segments. As can be seen from the above figure, for such a group of line arrangement, we can find a plan to cut all fruits in one knife.
In addition, we agree that if a line just passes through the end of the line segment, it also cuts the fruit represented by the line segment. If you are a developer of such functions, how do you find a straight line through them?
###Input format:
Enter a positive integer 'n' ($$Le 10 ^ 4 $$) in the first line to indicate the number of fruits. The next 'n' line gives three integers, $$X, $$y_ 1$$、$$y_ 2 $$, separated by spaces, indicating that an endpoint is $$(x, y)_ 1) $$and $$(x, y)_ 2) The fruit of $$, where $$Y_ 1 > y_ 2$$。 Note: the given fruit input set must have a straight line that can pass through it all, and it is not necessary to consider the case that it does not exist. Coordinates are integers in the interval $$[- 10 ^ 6, 10 ^ 6) $.
###Output format:
In a row, output any two points with * * integer * * coordinates on the line passing through all line segments $$P_ 1(x_ 1, y_ 1) $$and $$p_ 2(x_ 2, y_ 2) $$, in the form of $$X_ 1\quad y_ 1\quad x_ 2\quad y_ 2$$。 Note: the answer to this question is not unique, which is determined by the special judgment procedure, but there must be four solutions whose coordinates are all integers.
###Input example:
```in
five
-30 -52 -84
38 22 -49
-99 -22 -99
48 59 -18
-36 -50 -72
```
###Output example:
```out
-99 -99 -30 -52
```
answer：If there is no answer, please comment
**Figure 1**
Now if you are a "fruit ninja" game player, one of the things you have to do is to cut down the fruit in the picture. This problem seems a little complicated. Let's simplify it. We think of the game world as a two-dimensional plane. Each fruit in the game is simplified into a vertical line segment perpendicular to the horizontal line. We only consider whether we can find a straight line through all the lines representing the fruit.
**Figure 2**
As shown in Figure 2, the green vertical line segments represent the fruits one by one; The gray dotted line represents a straight line passing through all line segments. As can be seen from the above figure, for such a group of line arrangement, we can find a plan to cut all fruits in one knife.
In addition, we agree that if a line just passes through the end of the line segment, it also cuts the fruit represented by the line segment. If you are a developer of such functions, how do you find a straight line through them?
###Input format:
Enter a positive integer 'n' ($$Le 10 ^ 4 $$) in the first line to indicate the number of fruits. The next 'n' line gives three integers, $$X, $$y_ 1$$、$$y_ 2 $$, separated by spaces, indicating that an endpoint is $$(x, y)_ 1) $$and $$(x, y)_ 2) The fruit of $$, where $$Y_ 1 > y_ 2$$。 Note: the given fruit input set must have a straight line that can pass through it all, and it is not necessary to consider the case that it does not exist. Coordinates are integers in the interval $$[- 10 ^ 6, 10 ^ 6) $.
###Output format:
In a row, output any two points with * * integer * * coordinates on the line passing through all line segments $$P_ 1(x_ 1, y_ 1) $$and $$p_ 2(x_ 2, y_ 2) $$, in the form of $$X_ 1\quad y_ 1\quad x_ 2\quad y_ 2$$。 Note: the answer to this question is not unique, which is determined by the special judgment procedure, but there must be four solutions whose coordinates are all integers.
###Input example:
```in
five
-30 -52 -84
38 22 -49
-99 -22 -99
48 59 -18
-36 -50 -72
```
###Output example:
```out
-99 -99 -30 -52
```
answer：If there is no answer, please comment