#include <stdio.h>

// Function to check if a number is prime
int isPrime(int num) {
    if (num < 2)
        return 0;
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0)
            return 0;
    }
    return 1;
}

int main() {
    int n, arr, sum = 0, found = 0;

    // Read the size of the array
    if (scanf("%d", &n) != 1 || n < 1 || n > 10) {
        printf("Invalid Input\n");
        return 0;
    }

    // Read the elements of the array
    for (int i = 0; i < n; i++) {
        if (scanf("%d", &arr[i]) != 1 || arr[i] < 1 || arr[i] >= 100) {
            printf("Invalid Input\n");
            return 0;
        }
    }

    // Calculate sum of primes
    for (int i = 0; i < n; i++) {
        if (isPrime(arr[i])) {
            sum += arr[i];
            found = 1;
        }
    }

    if (found)
        printf("%d\n", sum);
    else
        printf("Invalid Input\n");
    
    return 0;
}