public class Euler130 {
    static boolean isPrime(int n) {
        if (n < 2)
            return false;
        if (n % 2 == 0)
            return n == 2;
        for (int p = 3; (long) p * p <= n; p += 2)
            if (n % p == 0)
                return false;
        return true;
    }

    static int A(int n) {
        int rem = 1 % n, k = 1;
        while (rem != 0) {
            rem = (rem * 10 + 1) % n;
            k++;
        }
        return k;
    }

    public static void main(String[] args) {
        int found = 0;
        long sum = 0;
        for (int n = 3; found < 25; n += 2) {
            if (n % 5 == 0 || isPrime(n))
                continue;
            if (n % 2 == 0 || n % 5 == 0)
                continue;
            int a = A(n);
            if ((n - 1) % a == 0) {
                found++;
                sum += n;
            }
        }
        System.out.println(sum);
    }
}