Next Palindrome Number

Given an integer \( N \), your task is to find the smallest palindrome number greater than \( N \). A palindrome number is one that reads the same backward as forward. For example, \( 131 \) is a palindrome because it remains unchanged when its digits are reversed.

You are required to read the input from stdin and print the output to stdout. Note that \( N \) could be very large (up to \( 10^{18} \)).

inputFormat

The input consists of a single integer \( N \) given in one line.

outputFormat

Output the smallest palindrome number that is strictly greater than \( N \).

123

131