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

using ll=long long;
#include<atcoder/modint>
using namespace atcoder;
using mint=modint998244353;


int main(){
	
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll N;
	cin>>N;
	vector<ll> A(N);
	for(int i=0;i<N;i++){
		cin>>A[i];
	}
	sort(A.begin(),A.end());
	ll X=1e9;ll Y=1;
	for(int i=0;i<N-1;i++){
		if(A[i]==A[i+1]){
			cout<<1<<" "<<1<<endl;
			return 0;
		}
		if(A[i+1]*Y<=A[i]*X){
			X=A[i+1];
			Y=A[i];
		}
	}
	ll G=gcd(X,Y);
	cout<<Y/G<<" "<<X/G<<endl;



}