#include<stdio.h>
#include<stdlib.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");
        return 0;
    }
    int *arr = (int *)malloc(n * sizeof(int));
    int sum = 0;
    int primeFound = 0;
    for(int i = 0;i  < n;i++) {
        if(scanf("%d",&arr[i]) != 1) {
            printf("Invalid Input");
            free(arr);
            return 0;
        }
        if( isPrime(arr[i])) {
            sum += arr[i];
            primeFound = 1;
        }
    }
    if(primeFound) {
        printf("%d",sum);
    } else {
        printf("Invalid Input");
    }
    free(arr);
    return 0;
}