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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int[] x = new int[n];

		for(int i=0;i<x.length;i++) {
			x[i] = sc.nextInt();
		}

		Arrays.sort(x);

		int v = x[x.length-1];
		if(v%2==1) {
			v+=1;
		}

		System.out.println(x[x.length-1]+" "+x[getNearestValue(x, v/2)]);

	}

	// 最も近い値を格納した配列の添え字を求める
	//http://talavax.com/nearestvalue.html より拝借
		public static int getNearestValue( int[] list, int v )
		{
			// 変数の宣言
			int i;		// ループ用
			int num;	// 配列の添え字
			int minv;	// 配列値-指定値vの絶対値

			// 配列の個数が1未満の処理
			if ( 1 >list.length ) return -1;

			// 指定値と全ての配列値の差を比較
			num = 0;
			minv = Math.abs( list[ 0 ] - v );
			for ( i = 1; i < list.length; ++ i ) {
				if ( Math.abs( list[ i ] - v ) < minv ) {
					num = i;
					minv = Math.abs( list[ i ] - v );
				}
			}

			return num;
		}

}