Time Limit: 3000 MS    Memory Limit: 65536 K 


You are given 2*n+2 numbers. There are n numbers in them, each appeared twice. Can you find out the other 2 numbers which only appeared once?


Multiple input cases. For each case, the first line is a integer n.(1 <= n <= 100000) Each of the following 2*N+2 lines gives an integer, each of which in range[0, 2^31-1].


Output these 2 number appeared only once. Please output the smaller one first, then output the larger one.

Sample Input

2 1 1 2 2 3 4

Sample Output

3 4


There exists a O(n) solution