#include <stdio.h>
#include <math.h>
struct queue { int data[10], f, r; };

int prime(int n) {
    if (n < 2) return 0;
    for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return 0;
    return 1;
}
int main() {
    struct queue q = {.f = -1, .r = -1 };
    int n, a[10];
    scanf("%d", &n);
    if (n <= 0) return printf("Invalid input"), 0;
    for (int i = 0; i < n; i++)
    scanf("%d", &a[i]);
    for (int i = 0; i < n; i++)
    if (prime(a[i])) q.data[++q.r] = a[i], q.f = (q.f == -1) ? 0 : q.f;
    for (int = q.f; i <= q.r && q.f != -1; i++)
    printf("%d ", q.data[i]);
}