Palindrome Number Checker

You are given a single integer \( n \). Your task is to determine whether the digits of \( n \) form a palindrome. An integer is said to be a palindrome if it reads the same backward as forward. Note that negative numbers are not considered palindromic.

For example:

• \( 121 \) is a palindrome because reversing its digits gives \( 121 \).
• \( 123 \) is not a palindrome because reversing its digits gives \( 321 \).
• \( -121 \) is not a palindrome.

The expected output is a boolean value: "True" if \( n \) is a palindrome, and "False" otherwise.

inputFormat

The input consists of a single line containing one integer \( n \).

Input Format:
n
Example: 121

outputFormat

Output a single line containing either "True" or "False" (without quotes) depending on whether the number is a palindrome.

Output Format:
True

121

True