Andrew Boktor

import java.math.*;


public class Algo196
{
    public static void main (String [] args)
    {
        BigInteger counter = new BigInteger ("10000000000000000000");
        BigInteger end = new BigInteger ("100000000000000000000");
        BigInteger one = new BigInteger ("1");
        while ( counter.compareTo (end) != 0 )
        {
            System.out.println ("Number: "+counter);
            System.out.println (algo196(counter.toString(), 1000));
            counter = counter.add (one);
        }


    }

    public static String algo196 (String n, int iter)
    {
        StringBuffer x = new StringBuffer (n);
        BigInteger temp1 = new BigInteger ("0");
        BigInteger temp2 = new BigInteger ("0");

        int i=0;
        while (i<=iter)
        {
            if (isPlayndrome (x.toString())) return "Iteration: "+i+"\n"+x.toString() ;
            else
            {
                temp1 = new BigInteger (x.toString());
                x.reverse();
                temp2 = new BigInteger (x.toString());
                temp1 = temp1.add (temp2);
                x = new StringBuffer(temp1.toString());
            }
            i++;
        }
        return "Not Found";
    }

    public static boolean isPlayndrome (String n)
    {
        for (int i=0; i<n.length()/2; i++)
        {
            if (!(n.charAt(i) == n.charAt(n.length()-i-1))) return false;
        }
        return true;
    }
}