Anagram Checker

This problem requires you to determine whether two given strings are anagrams of each other. Two strings are anagrams if they consist of the same characters in any order. Mathematically, for two strings s1 and s2, we require that \( |s1| = |s2| \) and the frequency of each character in s1 is equal to that in s2.

Your task is to read two strings from standard input and output "Yes" if they are anagrams, otherwise output "No".

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 containing either "Yes" if the two strings are anagrams of each other, or "No" otherwise.

listen
silent

Yes