B. Ugly Number
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A k-cyclic shift of an integer x is a function that removes the last k digits of x and inserts them in its beginning. For example, the k-cyclic shifts of 123 are 312 for k = 1 and 231 for k = 2.

Teo, a kid from Canada, learned from his Canadian friends this definition of ugly numbers: a number is ugly if, and only if every one of its k-cyclic shifts returns a number greater than or equal to it.

Given an n-digit decimal number x, can you answer if it is ugly or not?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 5 × 105), indicating the number of digits of the number.

The next line contains an n-digit decimal number, indicating the value of x.

Output

Output "Yes" if x is an ugly number and "No" otherwise.

Examples
Input
3
123
Output
Yes
Input
4
2214
Output
No