Valid Palindrome Checker

In this problem, you are given a string S and your task is to determine whether it is a valid palindrome. A valid palindrome is defined as a string that reads the same forward and backward after removing all non-alphanumeric characters and converting all letters to lower case. In other words, if ( f(s) ) represents the filtered version of the input string and ( f(s) = \text{reverse}(f(s)) ), then S is a palindrome.

inputFormat

The input consists of a single line containing the string S. The string may include spaces, punctuation, and characters of mixed case.

outputFormat

Output a single line containing either "True" if the given string S is a valid palindrome, or "False" otherwise.## sample

A man, a plan, a canal: Panama

True