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.ComponentModel;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.IO;
using System.Runtime.Remoting.Contexts;
using System.Security.Cryptography.X509Certificates;

namespace Contest
{
    class Scanner
    {
        private string[] line = new string[0];
        private int index = 0;
        public string Next()
        {
            if (line.Length <= index)
            {
                line = Console.ReadLine().Split(' ');
                index = 0;
            }
            var res = line[index];
            index++;
            return res;
        }
        public int NextInt()
        {
            return int.Parse(Next());
        }
        public long NextLong()
        {
            return long.Parse(Next());
        }
        public string[] Array()
        {
            line = Console.ReadLine().Split(' ');
            index = line.Length;
            return line;
        }
        public int[] IntArray()
        {
            var array = Array();
            var result = new int[array.Length];
            for (int i = 0; i < array.Length; i++)
            {
                result[i] = int.Parse(array[i]);
            }

            return result;
        }
        public long[] LongArray()
        {
            var array = Array();
            var result = new long[array.Length];
            for (int i = 0; i < array.Length; i++)
            {
                result[i] = long.Parse(array[i]);
            }

            return result;
        }
    }

    struct A
    {
        public int Value, Index;

        public A(int v, int i)
        {
            Value = v;
            Index = i;
        }
    }

    class Algorithm
    {
        public static int LowerBound<T>(T[] array, T target, int begin, int end, Comparison<T> comparison)
        {
            while (end - begin > 1)
            {
                int mid = (begin + end) / 2;
                if (comparison(array[mid], target) >= 0)
                {
                    end = mid;
                }
                else
                {
                    begin = mid;
                }
            }

            return end;
        }

        public static int LowerBound<T>(T[] array, T target, int begin, int end, IComparer<T> comparer)
        {
            return LowerBound(array, target, begin, end, comparer.Compare);
        }

        public static int LowerBound<T>(T[] array, T target, int begin, int end)
        {
            return LowerBound(array, target, begin, end, Comparer<T>.Default);
        }

        public static int LowerBound<T>(T[] array, T target, Comparison<T> comparison)
        {
            return LowerBound(array, target, -1, array.Length, comparison);
        }

        public static int LowerBound<T>(T[] array, T target, IComparer<T> comparer)
        {
            return LowerBound(array, target, -1, array.Length, comparer);
        }

        public static int LowerBound<T>(T[] array, T target)
        {
            return LowerBound(array, target, -1, array.Length);
        }
    }

    class Program
    {
        private int N;
        private int[] A;
        private void Scan()
        {
            var sc = new Scanner();
            N = sc.NextInt();
            A = sc.IntArray();
        }

        public void Solve()
        {
            Scan();
            Array.Sort(A);
            int b = A[N - 1];
            var t = Algorithm.LowerBound(A, b / 2, -1, N - 1);
            if (t == 0)
            {
                Console.WriteLine($"{b} {A[t]}");
            }

            if (t == N - 1)
            {
                Console.WriteLine($"{b} {A[t - 1]}");
            }
            else
            {
                double tt = (double)b / 2;
                if (t - tt > tt - t - 1)
                {
                    Console.WriteLine($"{b} {A[t - 1]}");
                }
                else
                {
                    Console.WriteLine($"{b} {A[t]}");
                }
            }
        }


        static void Main(string[] args)
        {
            new Program().Solve();
        }
    }
}