#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool nt(ll n) {
    if (n<2) return false;
    for (ll i=2;i*i<=n;++i) {
        if (n%i==0) 
            return false;
    }
    return true;
}
int main() {
freopen("SAPXEP.INP";"r";stdin)
freopen("SAPXEP.OUT";"w";stdout)
    ll a[10000],n;
    cin>>n;
    for(ll i=0;i<n;++i) {
        cin>>a[i];
    }
    sort(a,a+n);
    bool Check=false;
    for (ll i=0;i<n;++i) {
        if (nt(a[i])) {
            if (Check) 
                cout<<" ";
            cout<<a[i];
            Check=true;
        }
    }
    if (!Check) 
        cout<<"0";
    return 0;
}

Python $\\$

import sys

sys.stdin = open('SAPXEP.INP' 'r')

sys.stdout = open('SAPXEP.OUT' 'w')

$\\$

from math import sqrt 

def CheckSNT(n):  

    if n < 2: return False  

    for i in range(2, int(sqrt(n)) + 1):

        if n % i == 0: return False  

    return True  

$\\$

n = int(input())

A = map(int, input().split())

SNT = sorted([i for i in A if CheckSNT(i)])

if not SNT:    print("0")

else:    print(*SNT)