#include <fstream>
#include <algorithm>

using namespace std;

int n, d, cnt;
int v[100005];
bool a[1000005];

int main()
{
    ifstream cin("pairs.in");
    ofstream cout("pairs.out");
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    sort(v + 1, v + n + 1);
    for(int i = 1; i <= n; i++)
    {
        for(int j = v[i]; j <= v[n]; j+=v[i])
            a[j] = 1;
        for(int j = i + 1; j <= n; j++)
        {
            if(a[v[j]] == 0)
            {
                cnt++;
                cout << v[j] << " " << v[i] << "\n";
            }
        }
        for(int j = v[i]; j <= v[n]; j+=v[i])
            a[j] = 0;
    }
    //cout << cnt;
    return 0;
}