Score : 400 points
Let {\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order. From n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\rm comb}(a_i,a_j) is maximized. If there are multiple pairs that maximize the value, any of them is accepted.
Input is given from Standard Input in the following format:
n a_1 a_2 ... a_n
Print a_i and a_j that you selected, with a space in between.
5 6 9 4 2 11
11 6
\rm{comb}(a_i,a_j) for each possible selection is as follows:
Thus, we should print 11 and 6.
2 100 0
100 0