#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#define ll long long

using namespace std;

ll num[],ans[],prime[];

int n;

ll gcd(ll a,ll b)

{

    if (a<b) swap(a,b);

    return b==? a:gcd(b,a%b);

}

int main()

{

    int cnt=;

    while (scanf("%d",&n))

    {

        if (n==) break;

        cnt=;

        for (int i=; i<n; i++)

        {

            scanf("%lld",&num[i]);

            ans[i]=num[i];

        }

        for (int i=; i<n; i++)

        {

            while (ans[i]!=)//求出每个ans[i]对应的因子

            {

                ll g=ans[i];

                for (int j=; j<n; j++)

                {

                    if (ans[i]==) break;

                    ll h=gcd(g,ans[j]);

                    if (h!=)

                    {

                        g=h;

                    }

                }

                if (g!=){

                  prime[cnt++]=g;//把因子存起来

                  for (int k=; k<n; k++)

                    while (ans[k]%g==) ans[k]/=g;//这里要除干净，为了这个搞了好久没弄出来

                }

            }

        }

        sort(prime,prime+cnt);//给因子排完序，把质数因子放在了前面，后面的非质数因子其实没有用了

        for (int i=; i<n; i++)

            ans[i]=;

        for (int i=; i<cnt; i++)

        {

            ll tmp=prime[i];

            //cout<<tmp<<endl;

            int maxn=;

            int loc=;

            for (int j=; j<n; j++)

            {

                int  tm=;

                while (num[j]%tmp==)

                {

                    // cout<<num[j]<<" "<<tmp<<endl;

                    num[j]/=tmp;

                    tm++;

                    // cout<<tm<<endl;

                }

                if (tm>=maxn) //这里即可保证字典序最小

                {

                    maxn=tm;

                    loc=j;

                    //cout<<j<<" loc "<<tmp<<endl;

                }

            }

            for (int k=; k<maxn; k++)

                ans[loc]*=tmp;

        }

        printf("%lld",ans[]);

        for (int i=; i<n; i++)

            printf(" %lld",ans[i]);

        printf("\n");

    }

    return ;

}