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: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //ai>=v
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //ai>v
#define NUM(x,v) (POSU(x,v)-POSL(x,v))
const ll INF=1e9+7;
const ll N = 100002;
ll n;
vector<ll> a;
ll x,y,ansb,anss,ans=0;
ll comb(ll n,ll r){
	if(n==r)return 1;
	if(r==0)return 1;
	return comb(n-1,r)+comb(n-1,r-1);
}


int main(){
	cin>>n;
	FOR(i,0,n){
		ll k;
		cin>>k;
		a.push_back(k);
	}
	if(n==2){
		cout<<max(a[0],a[1])<<" "<<min(a[0],a[1])<<endl;
		return 0;
	}
	sort(a.begin(),a.end());
	ll q,w;
	q=a[POSL(a,a[n-1]/2)];
	w=a[POSU(a,a[n-1]/2)];
	if(abs(a[n-1]/2-q)<abs(a[n-1]/2-w)){
		anss=q;
	}else anss=w;
	cout<<a[n-1]<<" "<<anss<<endl;
	return 0;
}