CF634A.Island Puzzle

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.

一个遥远的群岛链包含 $n$ 个岛屿，编号为 $1$ 至 $n$。双向桥梁将这些岛屿连接成一个简单环——即桥梁连接岛屿 $1$ 和 $2$、岛屿 $2$ 和 $3$，依此类推，此外还有一座桥梁连接岛屿 $n$ 和 $1$。每个岛屿的中心都有一座完全相同的基座，其中除一座岛屿外，其余每座岛屿的基座上均放置着一座易碎的、颜色唯一的雕像。剩下的一座岛屿上仅有一个空基座。

岛民希望将雕像重新排列成一种新的顺序。为此，他们重复执行以下操作：首先，选择一座与空基座所在岛屿直接相邻的岛屿；然后，小心翼翼地将该岛屿基座上的雕像经由相连的桥梁搬运过去，并将其放置在空基座上。

请判断岛民是否能够将雕像排列成所期望的顺序。

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 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.

第一行包含一个整数 $n$（$2 \leq n \leq 200\,000$）—— 岛屿的总数。

第二行包含 $n$ 个用空格分隔的整数 $a_i$（$0 \leq a_i \leq n - 1$）—— 当前第 $i$ 座岛屿上放置的雕像编号。若 $a_i = 0$，表示该岛屿上没有雕像。保证所有 $a_i$ 互不相同。

第三行包含 $n$ 个用空格分隔的整数 $b_i$（$0 \leq b_i \leq n - 1$）—— 第 $i$ 座岛屿期望拥有的雕像编号。同样地，$b_i = 0$ 表示该岛屿不希望有任何雕像。保证所有 $b_i$ 互不相同。

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

如果可以在现有网络中完成重排，则输出 "YES"（不带引号）；否则输出 "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.

在第一个样例中，岛民可以首先将雕像 1 从岛屿 1 移动到岛屿 2，然后将雕像 2 从岛屿 3 移动到岛屿 1，最后将雕像 1 从岛屿 2 移动到岛屿 3。

在第二个样例中，岛民只需将雕像 1 从岛屿 1 移动到岛屿 2 即可。

在第三个样例中，不存在任何移动序列能够达到目标位置。