public class Euler183 {
    static int gcd(int a, int b) {
        while (b != 0) {
            int t = b;
            b = a % b;
            a = t;
        }
        return a;
    }

    public static void main(String[] args) {
        long total = 0;
        for (int n = 5; n <= 10000; n++) {
            int k = (int) Math.round((double) n / Math.E);
            if (k < 1)
                k = 1;
            int q = k / gcd(n, k);
            while (q % 2 == 0)
                q /= 2;
            while (q % 5 == 0)
                q /= 5;
            total += q == 1 ? -n : n;
        }
        System.out.println(total);
    }
}