Strict Palindrome Checker

Given a string s, remove all spaces from s to obtain a new string s'. The task is to determine whether s' is a strict palindrome, i.e. whether it reads the same forwards and backwards. Formally, let \( s' \) be the string after removing spaces from \( s \). The string is a strict palindrome if and only if \( s' = \text{reverse}(s') \).

Note that the check is case-sensitive, so characters with different cases are considered distinct.

inputFormat

The input consists of a single line containing the string s. The string may contain spaces and can be empty.

outputFormat

Output either True or False (without quotes) to indicate whether the given string is a strict palindrome after removing all spaces.

radar

True