Island Puzzle

题面翻译

给定一个环，点的编号为 $1\sim n$，其中 $i$ 和 $i+1$ 相邻，且 $1$ 和 $n$ 相邻。每个点上有一个 $[0,n-1]$ 范围内的数，且每个点上的数互不相同。每次可以交换 $0$ 所在的点和任意一个与其相邻的点的数，问能否达成指定的状态。

题目描述

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.

输入格式

The first line contains a single integer $n$ ( $2<=n<=200000$ ) — the total number of islands.

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

The third line contains $n$ space-separated integers $b_{i}$ ( $0<=b_{i}<=n-1$ ) — the desired statues of the $i$ th island. Once again, $b_{i}=0$ indicates the island desires no statue. It is guaranteed that the $b_{i}$ are distinct.

输出格式

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

样例 #1

样例输入 #1

3
1 0 2
2 0 1

样例输出 #1

YES

样例 #2

样例输入 #2

2
1 0
0 1

样例输出 #2

YES

样例 #3

样例输入 #3

4
1 2 3 0
0 3 2 1

样例输出 #3

NO

提示

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.