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 Go (1.6) (judge verdict: Wrong Answer)

// 最大値がnで中央値に一番近いやつがmっぽい lower_boundとupper_boundで見つける
// なんかうまくいかないのでアドホックに当てた

package main

import (
	"fmt"
	"sort"
)

func main() {
	var N int
	fmt.Scan(&N)
	A := make([]int, N)
	for i := 0; i < N; i++ {
		fmt.Scan(&A[i])
	}
	sort.Ints(A)
	P := A[N-1]
	Q1 := A[sort.Search(N, func(j int) bool {
		return (A[0]+A[N-1])/2 < A[j]
	})]
	sort.Sort(sort.Reverse(sort.IntSlice(A)))
	Q2 := A[sort.Search(N, func(j int) bool {
		return (A[0]+A[N-1])/2 >= A[j]
	})]
	if P == Q1 {
		fmt.Println(P, Q2)
		return
	}
	fmt.Println(Q1, Q2)
	if (float64(A[0])+float64(A[N-1]))/2.0-float64(Q1) < (float64(A[0]) + float64(A[N-1])/2.0 - float64(Q2)) {
		fmt.Println(P, Q1)
	} else {
		fmt.Println(P, Q2)
	}
}