def judge(n):
    flag=True
    if n==1:
        flag=False
    for i in range(2,n):
        if n%i==0:
            flag=False
            break
    return flag
n=int(input())
a=list(map(int,input().split()))

#使用冒泡排序算法对素数进行升序排序
for i in range(n):
    for j in range(n-1,i,-1):
        if judge(a[j]):
            if judge(a[j-1]) and a[j]<a[j-1] or not judge(a[j-1]):
                 a[j],a[j-1]=a[j-1],a[j]

for i in range(n):
    print(a[i],end=" ")