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

int n, d[120], ans_i, ans_j, x, k;
int main() {
    cin >> n;
    for (int i = 0; i < 120; i++)
        d[i] = -1;
    for (int i = 0; i < n; i++) {
        cin >> x;
        k = (120 - x % 120) % 120;
        if (d[k] != -1 && x + d[k] > ans_i + ans_j && d[k] > x)
            ans_i = d[k], ans_j = x;
        d[x % 120] = max(d[x % 120], x);
    }
    cout << ans_i << " " << ans_j;
    return 0;
}