#include<iostream>
using namespace std;
const int N=1e5;
int prime[N];
int vis[N];

int isprime(int num) {
    int ans = 0;
    for (int i = 2; i < N / i; i++) {
        if (!vis[i]) {
            prime[ans++] = i;
            for (int j = i * 2; j <= N; j += i) {
                vis[j] = 1;
            }
        }
    }
    for (int i = 0; i < ans; i++) {
        if (num == prime[i]) return 1;
    }
    return 0;
}
int main() {
    int n, arr[100];
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
      
    }
    for (int i = 0; i < n; i++) {
        if (isprime(arr[i])) {
            cout << arr[i]<<' ';
        }
   }
    return 0;
}