#include<iostream>
#include<cmath>
bool isprime(unsigned int n);
using namespace std;
int main()
{
    int n;
    cin>>n;
    unsigned int number[n];
    for(int index=0;index<n;index++)
    cin>>number[index];
    for(int index=0;index<n;index++)
    {if(isprime(number[index])) cout<<number[index]<<" ";}
    return 0;
} 
bool isprime(unsigned int n)
{
	bool jud=true;
	if(n==0)
	jud=false;
	else for(int i=2;i<=sqrt(n);i++)
	{
		if(n%i==0)
		jud=false;
	}
	return jud;
}