#include<stdio.h>
#include<math.h>
int isPrime(int num){
    if (num <= 1) return 0;
    for(int i = 2; i <= sqrt(num); i++){
        if (num % i == 0) return 0;
    }
    return 1;
}
int main(){
    int n;
    if (scanf("%d",&n) != 1 || n <= 0){
        printf("Invalid input\n");
        return 1;
    }
    int arr[n];
    int sum = 0;
    
    for (int i = 0; i < n; i++){
        if(scanf("%d", &arr[i]) != 1){
            printf("Invalid input\n");
            return 1;
        }
        
        if (sum == 0){
            printf("No prime numbers found\n");
        }else{
            printf("%d\n", sum);
        }
        retur
    }
}