For his birthday, Timofey got a metal detector form his parents. The next morning, the boy, of course, went in search of treasure. Naturally, the next day the boy went in search of treasure. He assumed that someone might have dropped a gold coin on an ancient straight road a long time ago and, to make his search easier, he came up with a coordinate system. The $$$OX$$$ horizontal axis goes along the road, and the $$$OY$$$ vertical axis goes upwards.
The device works as follows: a positive integer number $$$r$$$ is set on its indicator, and if there is a golden object exactly at this distance, the green light turns on.
First, the young treasure hunter set the number $$$r_1$$$ at point $$$x = 0$$$, then moved to the point with a horizontal coordinate $$$x = a$$$ and set the number $$$r_2$$$, as shown in the figure. Beginners are lucky, the green light turned on both times. Determine the coordinates of the long-lost gold coin.
The program gets three integers $$$a$$$, $$$r_1$$$, and $$$r_2$$$, that are written in separate lines ($$$1 \le a, r_1, r_2 \le 10^{9}$$$).
Output two numbers in two separate lines that are coordinates of the treasure (first is the horizontal coordinate, second stands for the vertical coordinate). The ordinate value cannot be negative (the coin cannot hang in the air). It should be assumed that the input data is such that the answer exists and both coordinates of the coin are integers.
Solutions that run correctly for $$$1 \le a, r_1, r_2 \le 100$$$ score $$$40$$$ points.
Solutions that run correctly for $$$1 \le a, r_1, r_2 \le 10^5$$$ score $$$60$$$ points.
21 10 17
6 -8
The figure illustrates the example from the problem.
