暴力求解——Equivalent Strings

Submit Status

Description

Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:

They are equal.

If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
a1 is equivalent to b1, and a2 is equivalent to b2

a1 is equivalent to b2, and a2 is equivalent to b1

As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.

Gerald has already completed this home task. Now it's your turn!

Input

The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.

Output

Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.

Sample Input

Input

aaba
abaa

Output

YES

Input

aabb
abab

Output

NO

解题思路：给两个字符串，判断它们是否相等，相等有两种情况，一个是直接相等，一个是切成长度相同的两份以后两子串交叉相等，用DFS，按照题意搜就行了，如果当前长度为奇数，直接返回false，否则分两种情况搜

程序链接：http://paste.ubuntu.com/11953312/