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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>

long long max(long long a, long long b) {
    if (a<b) return b;
    else return a;
}
long long min(long long a, long long b) {
    if (a>b) return b;
    else return a;
}

long long mindist(const long long n, long long a, long long b) {
    long long h = n/2;
    if (h%2) {
        if (min(llabs(h-a),llabs(h-a)) > min(llabs(h-b),llabs(h+1-b))) return b;
        else return a;
    } else {
        if (llabs(h-a) > llabs(h-b)) return b;
        else return a;
    }
}

int main(void) {
    int i, N;
    long long a[100010], m, r;
    scanf("%d", &N);
    for (i=0;i<N;i++) scanf("%lld", &a[i]);

    m = a[0];
    for (i=1;i<N;i++) m = max(m,a[i]);
    r = a[0];
    for (i=1;i<N;i++) r = mindist(m,r,a[i]);

    printf("%lld %lld\n", m, r);

    return 0;
}