Problem:
Score : 400 points

Problem Statement

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.

Constraints

2 \leq n \leq 10^5

0 \leq a_i \leq 10^9

a_1,a_2,...,a_n are pairwise distinct.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

n
a_1 a_2 ... a_n

Output

Print a_i and a_j that you selected, with a space in between.

Sample Input 1

5
6 9 4 2 11

Sample Output 1

11 6

\rm{comb}(a_i,a_j) for each possible selection is as follows:

\rm{comb}(4,2)=6

\rm{comb}(6,2)=15

\rm{comb}(6,4)=15

\rm{comb}(9,2)=36

\rm{comb}(9,4)=126

\rm{comb}(9,6)=84

\rm{comb}(11,2)=55

\rm{comb}(11,4)=330

\rm{comb}(11,6)=462

\rm{comb}(11,9)=55

Thus, we should print 11 and 6.

Sample Input 2

2
100 0

Sample Output 2

100 0

Solution in Python (3.4.3) (judge verdict: Time Limit Exceeded)

import math
n=int(input())
a=sorted(list(map(int,input().split())),reverse=True)
maxconb=0
ans=[0,0]

def comb(a,b):
    return math.factorial(a)//(math.factorial(a-b) * math.factorial(b))

def mid(a):
    if(a%2!=0):
        return (a+1)//2
    else:
        return a//2
#print(a)
for i in range(n-1):
    ai=a[i]
    temp=list(map(lambda x:abs(x-mid(ai)),a[i+1:]))
#    print(temp)
    bi=a[temp.index(min(temp))+i+1]
#    print(str(ai)+":"+str(bi))
    c=comb(ai,bi)
    if(maxconb<c):
        maxconb=c
        ans=[ai,bi]
print(str(ans[0])+" "+str(ans[1]))