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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Text;
using System.Linq;
using System.Collections.Generic;


class Program {

	const long mod = 1000000007;
	//public static int[] max;

	static void Main(string[] args) {

		char[] cs = new char[] { ' ', ',' };
		//int val = int.Parse(Console.ReadLine());
		//int[] vals = parseAry(Console.ReadLine().Split(cs));
		//string str = Console.ReadLine();
		//string[] strs = Console.ReadLine().Split(cs);

		//int[] vals = parseAry(Console.ReadLine().Split(cs));
		//int n = vals[0];
		//string res="";

		//int y = vals[0];
		//int x = vals[1];

		int n = int.Parse(Console.ReadLine());
		int[] vals = parseAry(Console.ReadLine().Split(cs));
		int[] vv = (int[])vals.Clone();

		Array.Sort(vals);

		//if (vals.Length == 2) { Console.WriteLine(vals[1] + " " + vals[0]);
			//return; }

		int res1 = vals[vals.Length - 1];
		vals[vals.Length - 1] = 0;
		Array.Sort(vals);
		int res2 = vals[Binary_Search(( 1.0 * res1) / 2.0 , vals)];
		//for (int i = 0; i < vals.Length; i++) {
		

		//}

			//deug
			Console.WriteLine(res1+" "+res2);

		return;
	}

	static private int Binary_Search(double x,int[] lis) {
		int Lower = 0;
		int Upper = lis.Length - 1;
		int bk = 0;
		while (Lower <= Upper) {
			int Center = ( Lower + Upper ) >> 1;
			if (x > lis[Center]) {
				bk = Lower;
				Lower = Center + 1;
			} else if (x < lis[Center]) {
				bk = Lower;
				Upper = Center - 1;
			} else {
				return Center;
			}
		}
		if (lis.Length > bk + 1) {
			if (Math.Abs(x - lis[bk]) > Math.Abs(x - lis[bk + 1])) {
				bk++;
			}
		}
		if ( bk-1 >= 0 ) {
			if (Math.Abs(x - lis[bk]) > Math.Abs(x - lis[bk - 1])) {
				bk--;
			}
		}
		return bk;
	}


	//　String[]  ----->  int[]
	static int[] parseAry(string[] str) {
		int[] nums = new int[str.Length];
		for (int i = 0; i < str.Length; i++) { nums[i] = int.Parse(str[i]); }
		return nums;
	}
	//　String[]  ----->  long[]
	static long[] parseAryl(string[] str) {
		long[] nums = new long[str.Length];
		for (int i = 0; i < str.Length; i++) { nums[i] = int.Parse(str[i]); }
		return nums;
	}



	//文字列を1文字ずつString[]に入れる
	static string[] strAry(String str) {
		string[] re = new string[str.Length];
		for (int i = 0; i < str.Length; i++) { re[i] = str[i].ToString(); }
		return re;
	}

}