import java.awt.List;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Palindromes {

	public static long val;
	public static long[] array = new long [(int) val];
	public static ArrayList<Long> newArrayList = new ArrayList<Long>();

	public static void main(String[] args) {

		System.out.println(findPalindromes(newArrayList));

	}

	public static ArrayList<Long> findPalindromes(ArrayList<Long> anArrayList) {

		System.out.print("Check numbers less than or equal to >> ");
		Scanner sc = new Scanner(System.in);
	    long val = sc.nextInt();
	    sc.close();
	    long[] valArray = new long[(int) (val + 1)];

	    for (int i = 0; i < valArray.length; i++) {
	        valArray[i] = i;
	    }

	    int count = 0;
	    ArrayList<Long> newArrayList = new ArrayList<Long>();
	    long a = 0;
	    long b = 0;
	    long c = 0;

	    		for(count = 0; count < val + 1; count++) {

	    			if(count < 10) {
	    				a = ((valArray[count] % 10)); // 1's place
	    				newArrayList.add(a);
	    			}

	    			if(count >= 10 && count < 100) {
	    				a = ((valArray[count] % 10)); // 1's place
		    	    	b = ((valArray[count] - a) % 100) / 10; // 10's place
		    	    	c = ((valArray[count] - a - b*10) / 100);// 100's place
	    	    	 if(a == b) {
	    	    		 newArrayList.add((b*10 + a));
	    	    	 }
	    			}

	    			if(count >= 100 && count < 1000) {
	    				a = ((valArray[count] % 10)); // 1's place
		    	    	b = ((valArray[count] - a) % 100) / 10; // 10's place
		    	    	c = ((valArray[count] - a - b*10) / 100);// 100's place
	    			 if(a == c) {
	    				newArrayList.add((c*100 + b*10 + a));
	    			 }
	    			}
	    		}

	   return newArrayList;
	}
}