#K43997. Largest Palindromic Number Product

    ID: 27433 Type: Default 1000ms 256MiB

Largest Palindromic Number Product

Largest Palindromic Number Product

Given two three-digit numbers, your task is to determine the largest palindromic number that can be obtained as the product of any two 3-digit numbers.

A palindromic number is a number that remains the same when its digits are reversed; that is, a number \(N\) satisfies \(N = \text{reverse}(N)\). Specifically, consider all numbers of the form \(i \times j\), where \(100 \leq i, j \leq 999\), and output the maximum palindrome among these products.

inputFormat

The program does not require any meaningful input. However, it must read input from the standard input (stdin) to adhere to the contest environment.

outputFormat

The program should output a single integer — the largest palindromic number that is the product of two three-digit numbers — to the standard output (stdout).

## sample
906609