#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

struct Prime {
    int max_n;
    std::vector<int> primes;
    std::vector<bool> isp;

    explicit Prime(int max_n)
        : max_n(max_n), isp(max_n + 1, true) {
        isp[0] = isp[1] = false;
        for (int i = 2; i * i <= max_n; ++i) {
            if (isp[i]) {
                for (int j = i; i * j <= max_n; ++j) {
                    isp[i * j] = false;
                }
            }
        }

        for (int p = 2; p <= max_n; ++p) {
            if (isp[p]) primes.push_back(p);
        }
    }

    template <class T>
    bool isprime(T n) const {
        if (n <= max_n) return isp[n];
        for (T p : primes) {
            if (p * p > n) break;
            if (n % p == 0) return false;
        }
        return true;
    }

    template <class T>
    std::vector<std::pair<T, int>> factorize(T n) const {
        std::vector<std::pair<T, int>> facts;
        for (T p : primes) {
            if (p * p > n) break;
            if (n % p != 0) continue;
            int exp = 0;
            while (n % p == 0) {
                n /= p;
                ++exp;
            }
            facts.emplace_back(p, exp);
        }
        if (n > 1) {
            facts.emplace_back(n, 1);
        }
        return facts;
    }

    template <class T>
    static std::vector<T> divisors(T n) {
        std::vector<T> ret;
        for (T p = 1; p * p <= n; ++p) {
            if (n % p != 0) continue;
            ret.push_back(p);
            if (n / p == p) continue;
            ret.push_back(n / p);
        }
        return ret;
    }
};

constexpr int X = 10000;

void solve() {
    int n, s;
    std::cin >> n >> s;

    std::vector<int> cnt(X + 1, 0);
    for (int i = 0; i < n - 1; ++i) {
        int x;
        std::cin >> x;
        ++cnt[x];
    }

    std::vector<std::vector<int>> xss(X + 1);
    for (int p = 1; p <= X; ++p) {
        auto& xs = xss[p];
        for (int x = p; x <= X; x += p) xs.push_back(x);

        std::sort(xs.begin(), xs.end(),
                  [&](auto x, auto y) {
                      return x / p != y / p ? x / p > y / p
                                            : cnt[x] > cnt[y];
                  });
    }

    std::cout << s << " ";

    for (int q = 0; q < n - 1; ++q) {
        int min = X * X + 1, nxt = -1;

        for (auto p : Prime::divisors(s)) {
            while (!xss[p].empty()) {
                auto x = xss[p].back();
                if (cnt[x] == 0) {
                    xss[p].pop_back();
                    continue;
                }

                auto y = x * s / p;
                if (y < min ||
                    (y == min && x < nxt)) {
                    min = y;
                    nxt = x;
                }
                break;
            }
        }

        --cnt[nxt];
        s = nxt;
        std::cout << s << " ";
    }

    std::cout << "\n";
}

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

    solve();

    return 0;
}