#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

ll my_gcd(ll a, ll b) {
    ll ret = 0;
    if (a < b) {
        swap(a, b);
    }
    if (b == 0) {
        ret = a;
    } else {
        ret = my_gcd(b, a % b);
    }
    return ret;
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    sort(A.begin(), A.end());
    ll ans_y = A[0];
    ll ans_x = A[1];
    for (ll i = 0; i < N - 1; i++) {
        if (ans_y * A[i + 1] < ans_x * A[i]) {
            ans_x = A[i + 1];
            ans_y = A[i];
        }
    }
    ll g = my_gcd(ans_x, ans_y);
    cout << ans_y / g << " " << ans_x / g << endl;
}