Skip to content
UPEEC

Anagram Check

Easy#strings#hashing#sorting· solved by 0 · time limit 2.0 s

Two words are anagrams if one is a rearrangement of the other. Print Yes if they are anagrams, else No.

Input

Two lines, each with one lowercase word.

Output

Yes or No.

Constraints

Each word has 1 to 10510^5 lowercase letters.

Sample 1

Input

listen
silent

Output

Yes

Sample 2

Input

rat
car

Output

No

Sign in or join free to run and submit your solution.