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

import java.util.*;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Set;

public class Main{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int[]a=new int[N];
        for(int i=0;i<N;i++){
            a[i]=sc.nextInt();
        }
        Arrays.sort(a);
        int[]b=new int[N];
        for(int i=0;i<N;i++){
            b[i]=a[i]/2;
        }
        int maxx=0;
        int[]c=new int[N];
        for(int k=0;k<N;k++){
        out:for(int i=0;;i++){
            int x=b[i];
            for(int j=0;j<N;j++)
            {
                if(x+i==a[j]){
                    c[k]=a[j];
                    break out;
                    
                }
                if(x-i==a[j]){
                    c[k]=a[j];
                    break out;
                }
                
            }
            
        }}
        int max=0;
        int x=0;
        int y=0;
        for(int i=0;i<N;i++){
            int aa=keisan(a[i],c[i]);
            if(aa>=max){
                x=a[i];
                y=c[i];
            }
        }
        System.out.println(x+" "+y);
        


}
public static int keisan(int a,int b){
    int sum=1;
    for(int ns=a-b+1,ms=1;ms<=b;ns++,ms++){
        sum*=ns;
        sum/=ms;
    }
    return sum;
}
        
        
    }