Typo

You have two strings S and T. You may choose two adjacent characters in S and swap them (You can also choose to not do this swap).

Is it possible to make S into T?

Input

The first line of input contains S

The second line of input contains T

Output

Output 'Yes' or 'No' without the quotes

Constraints

The two strings have the same length, and their lengths are between 2 and 100 inclusive.

Sample Input 1

abc
acb

Sample Output 1

Yes
We can swap the b and c to turn abc into acb.

Sample Input 2

aabb
bbaa

Sample Output 2

No

Sample Input 3

abcde
abcde

Sample Output 3

Yes
You can choose to not do the swap
Time Limit: 1 Seconds
Memory Limit: 1024MB
Your best score: 0
Source: ABC221

Subtask Score
1 100
2 0