Anagram Checker

Given two strings s and t, determine whether t is an anagram of s. Two strings are anagrams if they satisfy the conditions \( |s| = |t| \) and \( \forall c, \ \, count(c, s) = count(c, t) \). In other words, the frequency of each character in both strings must be identical.

inputFormat

The input consists of a single line containing two space-separated strings \( s \) and \( t \).

outputFormat

Output True if the two strings are anagrams of each other, otherwise output False.

listen silent

True