Valid anagram usernames

Problem

A college fest app does not allow a new username that is just the letters of an existing username in a different order, such as riya and aryi.

Given two usernames, print YES if the second one uses exactly the same letters as the first, each the same number of times. Otherwise print NO.

Input: The first line has the first username. The second line has the second username.
Output: One word: YES or NO.
Constraints: 1 ≤ length of each username ≤ 10^5
Usernames have only small letters a–z

Example 1

Input

riya
aryi

Output

YES

Both have one r, one i, one y and one a.

Example 2

Input

aab
abb

Output

NO

The first has two a, the second has two b.

Try the problem first. Open one hint at a time.

Hint 1

If the lengths differ, the answer is NO straight away.

Hint 2

Two usernames match when every letter appears the same number of times in both.

Hint 3

Use an int[26]: add 1 for each letter of the first username and subtract 1 for each letter of the second.

Hint 4

The answer is YES only if all 26 counts end at 0.

Write your Java code, run it on the examples and submit it to hidden tests.