Find a girl friend
CC wants to find a girl friend, he knows each girl's age and name in his class, and each girl’s age is different..
Now he wants to know the youngest girl's name and the eldest girl’s name, can you help him?
Input will consist of T test cases (1≤T≤10).
The first line of each test case contains a single integer n -- the number of girls (1≤n≤50).
Each of the following n lines contains Ai, Si, the ith girl's age and name (3≤age≤80, 2≤length(name)≤20), separated by exactly one space.
Each girl’s name consists of between 2 and 20 lowercase letters.
For each test case, output the youngest girl's name and the eldest girl's name, seperated by exactly one space.
5 21 liyuchun 18 fanbingbing 19 zhangziyi 22 liuyifei 20 liuyan 1 15 yangmi
fanbingbing liuyifei yangmi yangmi