fb pixel

Slice and dice

Given two arrays, you are asked if it’s possible to obtain the second one by slicing the first one at one location and swapping those parts. Empty slices are allowed.

Input

The first line of the input contains a single integer n the size of the two arrays (1 ≤ n ≤ 1000).
The second line contains n space-separated integers ().
The third line contains n space-separated integers ().

Output

The program should print Yes in case it’s possible to find a single location and slice the first array to obtain the second one after swapping the two slices, and No otherwise.

Examples

Input
Output
4 1 2 3 4 3 4 1 2
Yes
3 1 2 3 4 5 6
No
 
To check your solution you need to sign in
Sign in to continue