#include<iostream>
using namespace std;
bool isPrime(unsigned long long n) {
	if (n % 2 == 0)
		return false;
	unsigned int count = 3;
	while (count < n) {
		if (n % count == 0)
			return false;
		count += 2;
	}
	return true;
}
int main() {
	unsigned int numLen;
	cin >> numLen;
	for (unsigned int i = 0; i < numLen; i++) {
		unsigned long long inp;
		cin >> inp;
		if (isPrime(inp))
			cout << inp << ' ';
	}
}