The geese are invading, so Mr. White has bought a shotgun. He sits on his lawn chair in the middle of his lawn at the point 
~(0, 0)~ (his lawn also happens to be a Cartesian plane). There are 
~N~ geese that are standing on Mr. White's lawn, each one occupying a point with integer coordinates 
~(A, B)~. Mr. White's shotgun is CR branded and thus has infinite ammo, is on full auto, and has sniper sights, so his only challenge is figuring out how far away he has to shoot. Which point contains the goose that is farthest away from him?
Input Specification
On the first line, the positive integer ~N~ 
~(1 \le N \le 1\,000)~.
On the next ~N~ lines, two space-separated integers 
~A~ and 
~B~ 
~(-50\,000 \le A,B \le 50\,000)~ denoting the position of a goose.
Output Specification
The space-separated coordinates representing the position of the goose farthest away from Mr. White at ~(0, 0)~. If two geese are at the same distance, pick the one that appears first in the input.
Sample Input 1
4
3 4
5 -12
-9 -3
7 7
Sample Output 1
5 -12
Sample Input 2
5
15 17
-4 10
13 -20
27 -1
-11 5
Sample Output 2
27 -1
Comments
How is this not just a simple distance formula and find the one with the largest using greater than and not greater than or equal to maintain the priority? <-- Classic example of why programming even the most simple problems can still be difficult if you don't think of everyhting.
By far the funniest problem statement! omegalul!