Palindrome

import java.util.*;
import java.io.*;
import java.math.*;

/**
 * Auto-generated code below aims at helping you parse
 * the standard input according to the problem statement.
 **/
class Solution {

    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        long N = in.nextLong();
        while(!isPalindrome(String.format("%d",N)))
        {
            System.out.print(N+" ");
            N += Long.parseLong(reversedDigits(N));
        }
        System.out.println(reversedDigits(N));

    }
    public static boolean isPalindrome(String s)
    {
        if(s.length()%2 == 0)
            s = s.substring(0,s.length()/2) + "X" + s.substring(s.length()/2,s.length());

        for(int i = 0; i < s.length()/2; i++)
            if(s.charAt(i) != s.charAt(s.length()-i-1))
                return false;
        return true;
    }
    public static String reversedDigits(long x)
    {
        String num = String.format("%d",x);
        String n = "";
        for(int i = num.length()-1; i >= 0; i--)
            n+=num.charAt(i);
        return n;
    }
}