class Euler55 {

    private static class Options {
        int limit = 10000;
        int maxSteps = 50;
        boolean runCheckpoints = true;
    }

    private static boolean parseIntAfterPrefix(String arg, String prefix, int[] valueRef) {
        if (!arg.startsWith(prefix)) {
            return false;
        }
        String tail = arg.substring(prefix.length());
        if (tail.isEmpty()) {
            return false;
        }

        int parsed = 0;
        for (int i = 0; i < tail.length(); i++) {
            char c = tail.charAt(i);
            if (c < '0' || c > '9') {
                return false;
            }
            parsed = parsed * 10 + (c - '0');
        }
        valueRef[0] = parsed;
        return true;
    }

    private static boolean parseArguments(String[] args, Options options) {
        for (String arg : args) {
            if (arg.equals("--skip-checkpoints")) {
                options.runCheckpoints = false;
                continue;
            }
            int[] ref = new int[1];
            if (parseIntAfterPrefix(arg, "--limit=", ref)) {
                options.limit = ref[0];
                continue;
            }
            if (parseIntAfterPrefix(arg, "--max-steps=", ref)) {
                options.maxSteps = ref[0];
                continue;
            }
            System.err.println("Unknown argument: " + arg);
            return false;
        }
        return options.limit >= 1 && options.maxSteps >= 1;
    }

    private static boolean isPalindrome(String s) {
        int len = s.length();
        for (int i = 0; i < len / 2; i++) {
            if (s.charAt(i) != s.charAt(len - 1 - i)) {
                return false;
            }
        }
        return true;
    }

    private static String addDecimalStrings(String a, String b) {
        int n = Math.max(a.length(), b.length());
        StringBuilder out = new StringBuilder(n + 1);
        int carry = 0;

        for (int i = 0; i < n; i++) {
            int sum = carry;
            if (i < a.length()) {
                sum += a.charAt(a.length() - 1 - i) - '0';
            }
            if (i < b.length()) {
                sum += b.charAt(b.length() - 1 - i) - '0';
            }
            out.append((char)('0' + (sum % 10)));
            carry = sum / 10;
        }

        while (carry > 0) {
            out.append((char)('0' + (carry % 10)));
            carry /= 10;
        }

        return out.reverse().toString();
    }

    private static boolean isLychrelCandidate(int n, int maxSteps) {
        String value = Integer.toString(n);

        for (int step = 0; step < maxSteps; step++) {
            String rev = new StringBuilder(value).reverse().toString();
            value = addDecimalStrings(value, rev);
            if (isPalindrome(value)) {
                return false;
            }
        }

        return true;
    }

    private static int solve(int limit, int maxSteps) {
        int count = 0;
        for (int n = 1; n < limit; n++) {
            if (isLychrelCandidate(n, maxSteps)) {
                count++;
            }
        }
        return count;
    }

    private static boolean runCheckpoints() {
        if (isLychrelCandidate(47, 50)) {
            System.err.println("Checkpoint failed for 47");
            return false;
        }
        if (isLychrelCandidate(349, 3)) {
            System.err.println("Checkpoint failed for 349");
            return false;
        }
        return true;
    }

    public static void main(String[] args) {
        Options options = new Options();
        if (!parseArguments(args, options)) {
            System.exit(1);
        }
        if (options.runCheckpoints && !runCheckpoints()) {
            System.exit(2);
        }

        System.out.println(solve(options.limit, options.maxSteps));
    }
}