#include<iostream>
using namespace std;
bool isPrime(unsigned 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;
	if (numLen == 0)
		return 0;
	unsigned long *nums = new unsigned long[numLen]();
	for (unsigned int i = 0; i < numLen; i++) {
		nums[i] = 0;
	}
	unsigned int i2 = 0;
	for (unsigned int i = 0; i < numLen; i++) {
		unsigned long inp;
		cin >> inp;
		if (isPrime(inp)) {
			nums[i2++] = inp;
		}
	}
	for (unsigned int i = 0; i < i2 - 1; i++) {
		cout << nums[i] << ' ';
	}
	if(i2 != 0)
		cout << nums[i2 - 1];
}