Anagrams :
Difficulty Level : Easy
Submissions : 61
Asked In :
Marks :10
: 1 | : 0
Two strings are considered anagrams, if the letters of each string can be rearranged to make the two strings equal.
Given two strings $$$s$$$ and $$$t$$$, find whether they are anagrams or not.
Input
The first line of input consists of a string $$$s$$$ $$$(1 \leq |s| \leq 10^6)$$$ consisting of all lowercase English alphabet characters. The second line of input consists of a string $$$t$$$ $$$(1 \leq |t| \leq 10^6)$$$ consisting of all lowercase English alphabet characters.
Output
Output a single word - "YES" if the two strings are anagrams, otherwise "NO".
Example
Input
abcd dcba
Output
YES
