#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	int best = 0;
	for (int i = 0; i < n - 1; i++) {
		if (min(best, a.back() - best) < min(a[i], a.back() - a[i])) {
			best = a[i];
		}
	}
	cout << a.back() << ' ' << best << endl;
	return 0;
}
