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: Runtime Error)

using System;

namespace _094D
{
    class Program
    {
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());
            int[] x = new int[n];

            string[] str = Console.ReadLine().Split(' ');
            for (int i = 0; i < str.Length; i++)
            {
                x[i] = int.Parse(str[i]);
            }

            int max = 0;
            int mi = 0;
            int mj = 0;
            for (int i = 0; i < x.Length - 1; i++)
            {
                for (int j = (i+1); j < x.Length; j++)
                {
                    int c = comb(x[i], x[j]);
                    if (max < c) {
                        max = c;
                        mi = i;
                        mj = j;
                    }
                }
            }

            int o1 = x[mi];
            int o2 = x[mj];
            if (o1 > o2)
            {
                System.Console.WriteLine(o1.ToString() + " " + o2.ToString());
            } else
            {
                System.Console.WriteLine(o2.ToString() + " " + o1.ToString());
            }
        }

        static int comb(int n, int r)
        {
            int i, j;
            if (n >= r)
            {
                i = n;
                j = r;
            } else
            {
                i = r;
                j = n;
            }


            if ((i -j) < j)
            {
                j = i - j;
            }

            int upper = 1;
            int lower = 1;
            for (int s = 0; s < j; s++)
            {
                upper = upper * (i - s);
                lower = lower * (j - s);
            }
            return (upper / lower);
        }
    }
}