// Program 25: Prime, Even and Odd Array Arrangement

import java.util.*;
class PrimeEvenOdd {
    static boolean prime(int n) {
        if (n < 2) {
            return false;
        }
        for (int i = 2; i <= n / i; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] a = new int[10];
        int[] b = new int[10];
        int k = 0;
        for (int i = 0; i < 10; i++) {
            a[i] = sc.nextInt();
        }
        for (int i = 0; i < 10; i++) {
            if (prime(a[i])) {
                b[k++] = a[i];
            }
        }
        for (int i = 0; i < 10; i++) {
            if (!prime(a[i]) && a[i] % 2 == 0) {
                b[k++] = a[i];
            }
        }
        for (int i = 0; i < 10; i++) {
            if (!prime(a[i]) && a[i] % 2 != 0) {
                b[k++] = a[i];
            }
        }
        for (int x : b) {
            System.out.print(x + " ");
        }
    }
}