import java.util.*;

public class Solution {

    static Scanner sc = new Scanner(System.in);

    public static int[] completeAssignment(int N,int[] A){
    	boolean[] prime = new boolean[100005];
    	for(int i=0;i<100005;i++) {
    		prime[i] = true;
    	}

    	for(int i=2;i*i<=100005;i++) {
    		if(prime[i] == true) {
    			for(int j= i*i;j<100005;j+=i) {
    				prime[j] = false;
    			}
    		}
    	}

    	List<Integer> primeMember = new ArrayList<Integer>();
    	List<Integer> nonPrimeMember = new ArrayList<Integer>();

    	for(int i : A) {
    		if(prime[i] == true) {
    			primeMember.add(i);
    		}
    		else {
    			nonPrimeMember.add(i);
    		}
    	}

    	Collections.sort(primeMember);
    	Collections.sort(nonPrimeMember);

    	int[] result = new int[N];

    	int start = 0;

    	for(int i : primeMember) {
    		result[start] = i;
    		start++;
    	}

    	for(int i : nonPrimeMember) {
    		result[start] = i;
    		start++;
    	}

    	return result;
    }

    public static void main(String[] args) {
    	int N = sc.nextInt();
    	int[] A = new int[N];

    	for(int i=0;i<N;i++) {
    		A[i] = sc.nextInt();
    	}

    	int[] result = completeAssignment(N,A);

    	for(int i=0;i<N;i++) {
    		System.out.print(result[i] + " ");
    	}
    	System.out.println();
    }
}