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: Time Limit Exceeded)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.charset.StandardCharsets;


public class Main {
	
	static int n;
	static int[] a;
	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
	    BufferedReader in = new BufferedReader(reader);
		
		String s = in.readLine();
		n = Integer.parseInt(s);
		
		a = new int[n];
		
		s = in.readLine();
		String[] as = s.split(" ");
		
		for (int i=0; i < n; i++) {
			int input = Integer.parseInt(as[i]);
			a[i] = input;
		}
		System.out.println(solve());
	}
	


	private static String solve() {
		int max = 0;
		int c = 0;
		int left=0;
		int right=0;
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {
				if(i!=j) {
					c = comb(a[i],a[j]);
					if(max < c) {
						max=c;
						left = a[i];
						right = a[j];
						c=0;
					}
				}
			}
		}
		if(left>right) {
			return left + " " + right;
		} else {
			return right + " " + left;
		}
		
	}



	private static int comb(int a, int b) {
		// TODO Auto-generated method stub
		
		long child = 1;
		long mom = 1;
		for(int i = 0; i < b; i++) {
			child *= (a-i);
			mom *= (b-i);
		}
		if(mom == 0) return 1;
		return (int)(child/mom);
	}

	
	
}