#C8630. Anagram Checker

    ID: 52634 Type: Default 1000ms 256MiB

Anagram Checker

Anagram Checker

You are given two strings. Your task is to determine whether these two strings are anagrams of each other. Two strings are considered anagrams if they consist of the same characters in any order, after ignoring spaces and differences in letter case. For example, Listen and Silent are anagrams, as are A gentleman and Elegant man.

Note: All characters, including digits and special characters, are compared directly once spaces are removed and letters are normalized to lowercase.

inputFormat

The input consists of two lines. The first line contains the first string, and the second line contains the second string.

outputFormat

Output a single line: either True if the two strings are anagrams, or False otherwise.## sample

listen
silent
True