#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set1 = tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update>;
#define op()                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define yes cout << "YES\n";
#define no cout << "NO\n";
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a * b) / gcd(a, b))
#define PI 2.0 * acos(0.0)
#define Dpos(n) fixed << setprecision(n)

typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 1;

void solve()
{
    ll n, i, num, m;
    cin >> n;
    m = n;
    map<ll, ll> m1;
    while (n--)
    {
        cin >> num;
        ll temp = sqrt(num);
        for (i = 1; i <= temp; i++)
        {
            if (num % i == 0)
            {
                m1[i]++;
                if (num / i != i)
                    m1[num / i]++;
            }
        }
    }
    m1[0] = m;
    // for (auto it = m1.rbegin(); it != m1.rend(); it++)
    // {
    //     cout << it->first << ' ' << it->second << endl;
    // }
    for (i = 1; i <= m; i++)
    {
        for (auto it = m1.rbegin(); it != m1.rend(); it++)
        {
            if (it->second >= i)
            {
                cout << it->first << ' ';
                break;
            }
        }
    }
    cout << endl;
}
int main()
{
    op() int tc = 1;
    // cin >> tc;

    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case " << t << ": ";
        solve();
    }
}