Palindrome Checker

Given a string S, determine whether it is a palindrome. A palindrome is defined as a sequence of characters that reads the same forward and backward. In this problem, spaces, punctuation, and letter casing are ignored when determining if the string is a palindrome.

Mathematically, if we denote the cleaned version of S (with all non-alphanumeric characters removed and all letters converted to lowercase) as \( S' \), then the string is a palindrome if and only if \[ S' = \text{reverse}(S') \]

For example, the string "racecar" is a palindrome, while "hello" is not.

inputFormat

The input consists of a single line containing a string S. The string may include letters, digits, spaces, and punctuation.

outputFormat

Output a single line: "True" if the provided string is a palindrome (after ignoring non-alphanumeric characters and case), or "False" otherwise.

racecar

True