n=int(input())
arr=list(map(int,input().split()))
arr.sort()
y=arr[-1]
for i in range(1,y+1):
if(y%i==0):
arr.remove(i)
print(y,max(arr))#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
int main() {
int n;
cin >> n;
multiset<int>v;
for (int i = 0; i < n; i++) {
int o;
cin >> o;
v.insert(o);
}
int x = *max_element(v.begin(), v.end());
for (int i = 1; i <= x; i++) {
if (x % i == 0)
v.erase(v.find(i));
}
int y = *max_element(v.begin(), v.end());
cout << x << " " << y << endl;
return 0;
}
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |
1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |
677A - Vanya and Fence | 1621A - Stable Arrangement of Rooks |
472A - Design Tutorial Learn from Math | 1368A - C+= |
450A - Jzzhu and Children | 546A - Soldier and Bananas |
32B - Borze | 1651B - Prove Him Wrong |
381A - Sereja and Dima | 41A - Translation |
1559A - Mocha and Math | 832A - Sasha and Sticks |
292B - Network Topology | 1339A - Filling Diamonds |
910A - The Way to Home | 617A - Elephant |
48A - Rock-paper-scissors | 294A - Shaass and Oskols |
1213A - Chips Moving | 490A - Team Olympiad |