Permutation Check

Given two strings, determine whether one string is a permutation of the other after ignoring spaces and case differences. Formally, let ( p(s) ) be the processed version of string ( s ) where all whitespace characters are removed and all letters are converted to lowercase. The task is to decide if ( p(s_1) ) is a permutation of ( p(s_2) ), i.e., if the sorted sequence of characters of ( p(s_1) ) equals that of ( p(s_2) ).

inputFormat

The input consists of two lines. The first line contains the first string ( s_1 ) and the second line contains the second string ( s_2 ). Each string may contain spaces and mixed case letters.

outputFormat

Output a single line: "True" if the processed versions of the two strings are permutations of each other, or "False" otherwise.## sample

Listen
Silent

True