#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(int i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double

// using mint = modint1000000007;
using mint = modint998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1e18;

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

ll gcd(ll a, ll b){
    if(a%b == 0) return b;
    else return gcd(b, a%b);
}

int main(){

    ll n; cin >> n;
    vector<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    sort(a.begin(), a.end());

    long double ok = 0.0, ng = 2e9;
    while(ng-ok > 1e-10){
        long double mid = (ok+ng)/2;
        ll cnt = 0;
        rep(i, 0, n){
            // */a[i] <= mid の個数を調べる
            ll thl = mid*a[i];
            auto itr = upper_bound(a.begin(), a.end(), thl);
            // cout << mid << ' ' << a[i] << ' ' << thl << endl;
            cnt += itr-a.begin();
            if(a[i] <= thl) cnt--;
        }
        if(cnt < n*(n-1)/2) ok = mid;
        else ng = mid;
    }

    long double mi = 1e18;
    pair<int, int> ans;
    rep(i, 0, n){
        ll thl = ok*a[i];
        auto itr = upper_bound(a.begin(), a.end(), thl);
        if(itr != a.end()){
            if(mi > abs(ok-(long double)(*itr)/a[i])){
                ans = {*itr, a[i]};
                mi = abs(ok-(long double)(*itr)/a[i]);
            }
        }
    }
    int g = gcd(ans.first, ans.second);
    cout << ans.first/g << ' ' << ans.second/g << endl;

    return 0;
}