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 AtCoder.ABC094
{
    class d
    {
        static long[] factorial = new long[100001];
        static void Main(string[] args)
        {
            factorial[0] = 0;
            var line = Console.ReadLine().Trim();
            var N = int.Parse(line);
            line = Console.ReadLine().Trim();
            var spl = line.Split(' ');
            var A = Array.ConvertAll(spl, new Converter<string, int>(s => int.Parse(s)));
            var ans = 0L;
            var X = 0;
            var Y = 0;
            for (var i = 0; i < N - 1; ++i)
            {
                for (var j = i + 1; j < N; ++j)
                {
                    var max = Math.Max(A[i], A[j]);
                    var min = Math.Min(A[i], A[j]);
                    var n = Math.Min(min, max - min);
                    var calc = min == 0 ? 0 : Factorial(max)/Factorial(min)/Factorial(max - min);
                    if (ans <= calc)
                    {
                        ans = calc;
                        X = max;
                        Y = min;
                    }
                }
            }
            Console.WriteLine("{0:D} {1:D}", X, Y);
        }

        private static long Factorial(int v)
        {
            if (factorial[v] > 0) return factorial[v];
            if (v == 1) return 1;
            factorial[v] = v * Factorial(v - 1);
            return factorial[v];
        }
    }
}