Palindrome Checker

Given a string s, determine whether it is a palindrome after removing all non-alphanumeric characters and ignoring case differences. A string is considered a palindrome if, after filtering, it reads the same forwards and backwards. Formally, let the cleaned string be \(f = a_1a_2\dots a_k\). Then \(f\) is a palindrome if \(a_i = a_{k-i+1}\) for every \(1 \le i \le k\).

inputFormat

The input consists of a single line containing the string \(s\). The string may include spaces, punctuation, and other non-alphanumeric characters.

outputFormat

Output a single line with either "True" or "False". Print "True" if the processed string is a palindrome, or "False" otherwise.

A man, a plan, a canal: Panama

True