_03_BiggestThreePrimeNumbers

import java.util.Scanner;
import java.util.TreeSet;

public class BiggestThreePrimeNumbers {

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);
        String s = input.nextLine();
        long sum = 0;
        TreeSet<Integer> primeNumbers = new TreeSet<Integer>();
        String[] splittedS = s.split("[^-0-9]+");

        for (int i = 0; i < splittedS.length; i++) {
            if (splittedS[i].equals("")) {
                continue;
            }
            if (isPrime(Integer.parseInt(splittedS[i]))) {
                primeNumbers.add(Integer.parseInt(splittedS[i]));
            }
        }

        if (primeNumbers.size() < 3) {
            System.out.println("No");
        } else {
            String primeNumString = primeNumbers.toString();
            String[] splittedSum = primeNumString.split("[^-0-9]+");
            for (int i = splittedSum.length - 1; i >= 0; i--) {
                 if (i == splittedSum.length - 4) {
                     break;
                 }
                 sum += Long.parseLong(splittedSum[i]);
            }
            System.out.println(sum);
        }

    }

    private static boolean isPrime(Integer number) {
        int i;
        for (i = 2; i <= number / 2; i++) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }
}