Anagram Checker

This problem requires you to determine if two words are anagrams of each other. Two words are anagrams if one word's letters can be rearranged to form the other word. Each line of input contains a pair of words. You need to check each pair and output True if they are anagrams, and False otherwise.

Note: All words consist of lowercase English letters.

inputFormat

The input is read from standard input and consists of multiple lines. Each line contains two words separated by a space. There is no extra space at the end of the lines.

outputFormat

For each line of input, output a single line containing either True or False (without quotes) based on whether the two words are anagrams.

listen silent
hello llohe
part trap
part ape

True
True
True
False