import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;

import std.math;

void main() {
    int n;
    scan(n);
    auto a = readln.split.to!(int[]).sort();

    auto amax = a.reduce!max;
    int r = -1;
    auto dif = 10^^9 + 1;

    foreach (i ; 0 .. n - 1) {
        if (min(abs(amax / 2 - a[i]), abs((amax + 1) / 2 - a[i])) < dif) {
            dif = min(abs(amax / 2 - a[i]), abs((amax + 1) / 2 - a[i]));
            r = a[i];
        }
    }

    writefln("%d %d", amax, r);
}



void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
