Kinky Letters Movement#12832

Kinky Letters Movement

4 seconds
512 megabytes
Medium

You are given two strings s_1 and s_2.

In one step you can choose any substring from s_1 and reverse it. For example, from the string "abcdef", you can get "aedcbf".

Can you get s_1 to be equal s_2 in four such operations on string s_1 only?

A string is a substring of a string if can be obtained from by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.

Input

The first line contains a string s_1 (1 \leq |s_1| \leq 50).

The second line contains a string s_2 (|s_1| = |s_2|).

The strings contain only lowercase English letters.

Output

Print "Yes" if it is possible to transform s_1 to s_2 or "No" otherwise.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading