#include <iostream>
#include <sstream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <bitset>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define SUM(a) accumulate(ALL(a), 0)
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N;

int gcd(int a, int b) {
    while (a % b != 0) {
        int tmp = a % b;
        a = b;
        b = tmp;
    }
    return b;
}

signed main()
{
    cin >> N;
    vector<int> A(N);
    map<int, int> M;
    REP(i,N) {
        cin >> A[i];
        M[A[i]]++;
    }
    
    REP(i,N-1) {
        int a = A[i];
        M[a]--;
        // 倍数がないか探す
        int j = 1;
        bool hasj = false;
        while (j <= 10000) {
            if (M[j]) {
                A[i+1] = j;
                hasj = true;
                break;
            }
            if (j == 1 && a != 1) j = a;
            else j += a;
        }
        if (hasj) continue;
        // 順番に探す
        int minlcm = 1e15;
        int minlcmj = 1e15;
        //FOR(j,i+1,N) {
        for (auto &kv : M) {
            int j = kv.first;
            if (!M[j]) continue;
            int lcm = a * j / gcd(a, j);
            if (lcm < minlcm) {
                minlcm = lcm;
                minlcmj = j;
            } else if (lcm == minlcm && j < minlcmj) {
                minlcmj = j;
            }
        }
        A[i+1] = minlcmj;
    }
    
    REP(i,N) {
        if (i) cout << " ";
        cout << A[i];
    }
    cout << endl;
    
    return 0;
}