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

using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using System.Numerics;

class Program
{
    static void Main()
    {
        var n = int.Parse(ReadLine());
        var a = ReadLine().Split().Select(int.Parse).ToArray();
        Array.Sort(a);
        BigInteger m = 0;
        var ans = a[n - 1];
        var ansb = a[0];
        for (int i = n - 1; i > n / 2; i--)
        {
            var u = i;
            var l = 0;
            while (u - l > 0)
            {
                var v = (u + l - 1) / 2;
                if (a[v] < a[i] / 2)
                {
                    l = v + 1;
                }
                else
                {
                    u = v;
                }
            }
            for (int j = u - 4; j < 9; j++)
            {
                if ((uint)j < n)
                {
                    var c = C(a[i], a[j]);
                    if (m < c)
                    {
                        ans = a[i];
                        ansb = a[j];
                        m = c;
                    }
                }
            }
        }
        WriteLine($"{ans} {ansb}");
    }
    static BigInteger C(int n, int r)
    {
        var N = n - r;
        var R = 0;
        BigInteger a = 1;
        for (int i = 0; i < r; i++)
        {
            R++;
            N++;
            a = a * N / R;
        }
        return a;
    }
}