import java.util.*;

public class Euler125 {
    static boolean isPalin(long n) {
        String s = Long.toString(n);
        return s.equals(new StringBuilder(s).reverse().toString());
    }

    public static void main(String[] args) {
        long limit = 100000000L;
        int maxBase = 1;
        while ((long) maxBase * maxBase < limit)
            maxBase++;
        long[] prefix = new long[maxBase + 1];
        for (int i = 1; i <= maxBase; i++)
            prefix[i] = prefix[i - 1] + (long) i * i;
        Set<Long> vals = new HashSet<>();
        for (int s = 1; s <= maxBase; s++)
            for (int e = s + 1; e <= maxBase; e++) {
                long sum = prefix[e] - prefix[s - 1];
                if (sum >= limit)
                    break;
                if (isPalin(sum))
                    vals.add(sum);
            }
        long total = 0;
        for (long v : vals)
            total += v;
        System.out.println(total);
    }
}