#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

struct Rational{
	__int128_t u, d;
	Rational(__int128_t _u, __int128_t _d){
		assert(_d != 0);
		if(_d < 0){
			_u *= -1;
			_d *= -1;
		}
		__int128_t g = gcd(_u, _d);
		u = _u / g;
		d = _d / g;
	}
	bool operator==(Rational rhs) const{
		return u == rhs.u and d == rhs.d;
	}
	bool operator<(Rational rhs) const{
		return u * rhs.d < rhs.u * d;
	}
	bool operator<(__int128_t val) const{
		return u < val * d;
	}
	bool operator>(__int128_t val) const{
		return u > val * d;
	}
};

int main(){
	int n;
	cin >> n;
	vector<long long> a(n);
	cin >> a;
	sort(a.begin(), a.end());
	rep(i, n - 1){
		if(a[i] == a[i + 1]){
			cout << "1 1\n";
			return 0;
		}
	}
	vector<Rational> vec;
	rep(i, n - 1){
		Rational r(a[i], a[i + 1]);
		vec.push_back(r);
	}
	sort(vec.begin(), vec.end());
	auto r = vec.back();
	cout << (long long)r.u << ' ' << (long long)r.d << "\n";
	
	
	return 0;
}