Perfect Palindrome Checker

You are given a string (S) consisting of uppercase and lowercase English letters (and possibly spaces). Your task is to determine whether (S), when converted entirely to lowercase, is a perfect palindrome; that is, it reads the same forwards and backwards. Note that spaces and all characters are treated as significant.

For example, if (S = \texttt{AmanaplanacanalPanama}), then the answer is True because after converting to lowercase it becomes (amanaplanacanalpanama), which is a palindrome. However, for (S = \texttt{A man a plan a canal Panama}), the answer is False because the spaces disrupt the palindrome structure.

inputFormat

The input consists of a single line string (S) containing uppercase and lowercase English letters and possibly spaces. The entire string should be read from standard input.

outputFormat

Output a single line: True if the string is a perfect palindrome when case is ignored, otherwise False.## sample

AmanaplanacanalPanama

True