Largest Palindromic Product of Two 3-digit Numbers

In this problem, you are required to find the largest palindromic number that is a product of two 3-digit numbers. A palindrome is a number that remains the same when its digits are reversed. Mathematically, a number \( n \) is a palindrome if and only if \( n = \text{reverse}(n) \).

Your task is to compute the maximum palindrome \( P = a \times b \), where \( a \) and \( b \) are 3-digit numbers (i.e., \( 100 \leq a, b \leq 999 \)).

inputFormat

There is no meaningful input for this problem. However, your program must read from stdin (even if the input is unused) and output the answer to stdout.

outputFormat

Output a single integer representing the largest palindromic product of two 3-digit numbers.

0

906609