using System;
using System.Collections.Generic;
using System.Text;

namespace Euler4
{
    class Program
    {
	//Find the largest palindrome made from the product of two 3-digit numbers.
        public static string Reverse(string str)
        {
            int len = str.Length;
            char[] arr = new char[len];

            for (int i = 0; i < len; i++)
            {
                arr[i] = str[len - 1 - i];
            }

            return new string(arr);
        }

        static void Main(string[] args)
        {
            int n = 3;

            long left = (long) Math.Pow(10, n) - 1;
            long right = left;


            long palyndrom = 0;

            for (long i = left; i > 0; --i)
            {
                for (long j = right; j > 0; --j)
                {
                    long prod = i * j;

                    if (prod.ToString() == Reverse(prod.ToString()))
                    {
                        if (prod > palyndrom)
                        {
                            palyndrom = prod;
                            Console.WriteLine("Bigger Palyndrom found for " + n + " digit number: " + prod + " (" + i + " * " + j + ") ");
                        }
                    }
                }
            }
            Console.WriteLine("Biggest Palyndrom found for " + n + " digit number: " + palyndrom);
            Console.ReadLine();
        }
    }
}