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 Pascal (FPC 2.6.2) (judge verdict: Accepted)

var m,x,y,n:longint;
    i:longint;
    a:Array[0..100500]of longint;
procedure qs(l,r:longint);
var i,j,m,t:longint;
begin
  i:=l;
  j:=r;
  m:=a[(l+r)>>1];
  repeat
    while a[i]<m do inc(i);
    while a[j]>m do dec(j);
    if i<=j then
    begin
      t:=a[i];a[i]:=a[j];a[j]:=t;
      inc(i);
      dec(j);
    end;
  until i>j;
  if l<j then qs(l,j);
  if i<r then qs(i,r);
end;
function find1(x:longint):longint;
var l,r,m:longint;
begin
  l:=1;
  r:=n-1;
  while l<=r do
  begin
    m:=(l+r)>>1;
    if a[m]<x then l:=m+1 else r:=m-1;
  end;
  exit(l);
end;
function find2(x:longint):longint;
var l,r,m:longint;
begin
  l:=1;
  r:=n-1; 
  while l<=r do
  begin
    m:=(l+r)>>1;
    if a[m]>x then r:=m-1 else l:=m+1;
  end;
  exit(r);
end;
begin
  read(n);
  for i:=1 to n do
  read(a[i]);
  qs(1,n);
  m:=(a[n]+1) div 2;
  x:=find1(m);
  y:=find2(m);
  if a[x]-m<m-a[y] then writeln(a[n],' ',a[x]) else writeln(a[n],' ',a[y]);
end.