Description

Peter’s Boss is now very upset. He said that Peter’s vision of the orthogonal sum of two strings is not collinear to the general pary line of RIGS. At least, it is very bad that the orthogonal sum of two strings in Peter’s vision can be different depending on a selected set of strings. But Boss decided to give Peter a last str…well, a chance.

Peter’s colleague Andrew invented another definition of orthogonal sum of two strings of equal length n, which depends only on the alphabet. The basic alphabet to define this operation consists only of zeros and ones. The orthogonal sum of two strings a ⊕ b is just a string c where c_i = a_i ⊕ b_i (S_i denotes i-th character of string S). Here ⊕ stands for exclusive OR operation which returns 0 for equal characters and 1 otherwise.

Now Peter must study properties of orthogonal closure of a given string S. The orthogonal closure of S (denoted S^⊕) is a set of strings S_(k) ⊕ S_(l) for any 0 ≤ k, l ≤ n − 1, where n is the length of S, and S_(k) denotes an operation of k-th circular shift of S — moving k last characters from the end of the string S to its beginning. For example, the second circular shift of abcde is deabc.

Given a string T, Peter’s task is to check whether it belongs to S^⊕. Could you solve this task for him?

Input

The first line of the input file contains a given string T. The second line contains S. Both strings are of equal length in range from 1 to 5 000 characters. All characters in these strings are zeros or ones.

Output

If a given string belongs to S^⊕, output “Yes”. Otherwise output “No”.

<table style="border-color: black; border-collapse: collapse;" border="1"><tbody><tr><th>#1</th><td>11111<br>10101</td></tr><tr><th>#2</th><td>11110<br>10101</td></tr></tbody></table>

<table style="border-color: black; border-collapse: collapse;" border="1"><tbody><tr><th>#1</th><td>No</td></tr><tr><th>#2</th><td>Yes</td></tr></tbody></table>

Source

, Northern Subregion