Largest Palindrome Product

In this problem, you are required to find the largest palindromic number that is the product of two 3-digit numbers. A number is said to be a palindrome if it reads the same backward as forward. For instance, the number (906609) is a palindrome because reversing its digits yields the same number and it is the product of two 3-digit numbers (913 and 993).

The mathematical formulation of a palindrome for an integer (n) can be described as: if (n = d_1 d_2 ... d_k) in base 10, then (n) is a palindrome if (d_i = d_{k-i+1}) for all (1 \leq i \leq k).

Your task is to output the largest palindrome product obtained from multiplying any two 3-digit numbers. Note that the program does not process any input value; instead, it computes the result directly.

inputFormat

The program will receive an arbitrary string from standard input, which should be ignored. The computation does not depend on the input.

outputFormat

Output a single integer: the largest palindrome made from the product of two 3-digit numbers. The output should be written to standard output.## sample

dummy

906609