634A.Island Puzzle

A. Island Puzzle

time limit per test
2 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output

A remote island chain contains n islands, labeled 1 through n.
Bidirectional bridges connect the islands to form a simple cycle — a bridge connects islands 1 and 2,
islands 2 and 3, and so
on, and additionally a bridge connects islands n and 1.
The center of each island contains an identical pedestal, and all but one of the islands has a fragile, uniquely colored statue currently held on the pedestal. The remaining island holds only an empty pedestal.

The islanders want to rearrange the statues in a new order. To do this, they repeat the following process: First, they choose an island directly adjacent to the island containing an empty pedestal. Then, they painstakingly carry the statue on this island across
the adjoining bridge and place it on the empty pedestal.

Determine if it is possible for the islanders to arrange the statues in the desired order.

Input

The first line contains a single integer n (2 ≤ n ≤ 200 000) —
the total number of islands.

The second line contains n space-separated integers ai (0 ≤ ai ≤ n - 1) —
the statue currently placed on the i-th island. If ai = 0,
then the island has no statue. It is guaranteed that the ai are
distinct.

The third line contains n space-separated integers bi (0 ≤ bi ≤ n - 1)
— the desired statues of the ith island. Once again, bi = 0indicates
the island desires no statue. It is guaranteed that the bi are
distinct.

Output

Print "YES" (without quotes) if the rearrangement can be done in the existing network, and "NO"
otherwise.

Examples

input

3
1 0 2
2 0 1

output

YES

input

2
1 0
0 1

output

YES

input

4
1 2 3 0
0 3 2 1

output

NO

Note

In the first sample, the islanders can first move statue 1 from island 1 to
island 2, then move statue 2 from
island 3 to island 1,
and finally move statue 1 from island 2 to
island 3.

In the second sample, the islanders can simply move statue 1 from island 1 to
island 2.

In the third sample, no sequence of movements results in the desired position.

算法思路：去0后，利用除余比较字符串是否相同

#!/usr/bin/python
# -*- coding:utf-8 -*-
def KMP(desired,currently):
i=0
flag=True
pos=currently.index(desired[0])
while(i<len(desired)):
for j in range(pos,pos+len(currently)):
if desired[i]==currently[j%len(currently)]:
i=i+1
else:
flag=False
break
if flag==False:
break
return flag
n=int(raw_input())
currently=map(int,raw_input().split(' '))
desired=map(int,raw_input().split(' '))
currently.remove(0)
desired.remove(0)
result=KMP(desired,currently)
if result==True:
print "YES"
else:
print"NO"