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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define debug(x) cerr << fixed << #x << " is " << x << endl;

const int MAX = 100005;
int v[MAX];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);

	int n, Max = -1;
	cin >> n;

	for(int i = 0; i < n; i++)
	{
		cin >> v[i];
		Max = max(Max, v[i]);
	}

	int get1 = Max/2, get2 = (Max+1)/2;
	int best, Min = INT_MAX;

	for(int i = 0; i < n; i++)
	{
		if(v[i] == Max)
			continue;
		if(abs(get1-v[i]) < Min)
		{
			Min = abs(get1-v[i]);
			best = v[i];
		}
		if(abs(get2-v[i]) < Min)
		{
			Min = abs(get2-v[i]);
			best = v[i];
		}
	}

	cout << Max << " " << best << endl;

	return 0;
}


// int main()
// {
// 	ll fat[11], comb[11][11];
// 	fat[0] = 1;
// 	for(int i = 1; i < 11; i++)
// 		fat[i] = i*fat[i-1];
// 	for(int i = 0; i < 11; i++)
// 		for(int j = 0; j < i; j++)
// 			comb[i][j] = fat[i]/(fat[j]*fat[i-j]);
// 	int t = 10;
// 	while(t--)
// 	{
// 		int n = rand()%11, Max = -1, best = -1, aux = INT_MAX;
// 		cin >> n;
// 		int v[n];
//
// 		for(int i = 0; i < n; i++)
// 		{
// 			v[i] = ((rand())%11+1000000)%11;
// 			Max = max(Max, v[i]);
// 		}
// 		int get = Max/2;
// 		for(int i = 0; i < n-1; i++)
// 		{
// 			if(v[i] == Max)
// 				continue;
// 			if(abs(get-v[i]) < aux)
// 			{
// 				aux = abs(get-v[i]);
// 				best = v[i];
// 			}
// 		}
// 		cout << Max << " " << best << endl;
// 	}
// }