Permutation Checker

Given two strings, determine if one string is a permutation of the other, ignoring spaces and case. In other words, check whether the sorted characters of the two strings (after converting to lowercase and removing spaces) are identical. Formally, let \( s_1 \) and \( s_2 \) be the two strings processed by removing spaces and converting to lowercase. The task is to determine if

\( sorted(s_1) = sorted(s_2) \)

If the condition holds, the answer is True otherwise False.

inputFormat

The input is provided via stdin and consists of two lines:

• The first line contains the first string.
• The second line contains the second string.

Spaces may appear within the strings.

outputFormat

The output should be printed to stdout and must be a single line containing either True or False (case-sensitive) indicating whether the two strings are permutations of each other under the specified conditions.

Listen
Silent

True