#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxN = 1e5 + 5;
ll N, c[maxN], ans, dp[maxN], idx;
bool cmp(ll x, ll y) {
	return (x <= y);
}
int main(void) {
	scanf("%lld", &N);
	for (ll i = 1; i <= N; ++i) {
		scanf("%lld", &c[i]);
	}
	sort(c + 1, c + N + 1, cmp);
	for (ll i = 1; i <= N; ++i) {
		if (c[i] * (N - i + 1) > ans) {
			ans = c[i] * (N - i + 1);
			idx = c[i];
		}
	}
	printf("%lld %lld", ans, idx);
	return 0;
}