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 Ruby (2.3.3) (judge verdict: Accepted)

require 'pp'
# IS_DEBUG = true
IS_DEBUG = false
def dputs str
	if(IS_DEBUG)
		puts str
	end
end
def dpp str
	if(IS_DEBUG)
		pp str
	end
end

require 'pp'

N,d=gets.chomp.split(' ').map{|n| n.to_i}
A = Array.new(N)
A=gets.chomp.split(' ').map{|n| n.to_i}.sort

#(N-1).downto(0){|d|
d = N-1
	s = A[d]
	#0 1 2 3 -> 1, 2
	#0 1 2 3 4 -> 2, 2
	t_best_l = s/2
	t_best_h = s/2+(s%2)
	t = nil
	t_diff = nil
	(N-2).downto(0){|e|
		t2 = A[e]
		diff = (t2 >= t_best_h ? t2 - t_best_h : t_best_l - t2)
		if(t.nil? || t_diff > diff)
			t = t2
			t_diff = diff
		end
	}
#}

puts "#{s} #{t}"