Rybka unsuccessfully tried to explain Watson what palindrome is, but he understands only numbers. Then Rybka decided to give Watson palindrome number. Number is palindrome if it can be read in the same way left to right and right to left. However, to make Watson’s life funnier, she wants to give this number as \textbf{2} multipliers. You need to find the biggest palindrome number, which is a product of two numbers, each less than \textbf{N}. \InputFile One integer \textbf{N}. \textbf{1} ≤ \textbf{N} ≤ \textbf{1000}. \OutputFile You need to print two integers, multipliers of the biggest palindrome number (first smaller one, then bigger). If there several possible pairs, print the pair with the smallest first number.