import java.util.HashSet;

import java.util.Set;

public class Euler2 {
    public static void main(String[] args) {
        Set<Integer> niezle = new HashSet<>();

        long c;
        String d;
        for (int a = 999; a >= 100; a--) {
            for (int b = 999; b >= 100; b--) {
                c = a * b;
                d = String.valueOf(c);
                if (d.charAt(d.length() - 1) == d.charAt(0) && d.charAt(d.length() - 2) == d.charAt(1) && d.charAt(d.length() - 3) == d.charAt(2))
//                    System.out.println(d);
                    niezle.add(Integer.parseInt(d));
            }
        }
        System.out.println(niezle);

    }
}