Codeforces 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 = 0 indicates 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.

题意：有n和岛屿，1连2，2连3，3连4......n-1连n，n连1。初始有n-1个岛屿上有雕像，只有一个岛屿没有。若两个岛屿相邻且一个无雕像、一个有雕像。则可以将雕像移到无雕像的岛屿。给定初状态和末状态，问可不可以达到。

思路：抛开没有雕像的岛屿，其它岛屿上的雕像编号是递增的，1-2-3....-n、 n-1-2....。那么直接判定就好了。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <string>
#define CLR(a, b) memset(a, (b), sizeof(a))
using namespace std;
typedef long long LL;
const int MAXN = 2*1e5+10;
const int INF = 0x3f3f3f3f;
int a[MAXN], b[MAXN], n;
int next[MAXN];
bool same(int pos)
{
    for(int i = 0; i < n; i++)
    {
        if(i == pos) continue;
        int np = (i + 1) % n;
        if(np == pos) np = (np + 1) % n;
        if(a[np] != next[a[i]]) return false;
    }
    return true;
}
int main()
{
    cin >> n; int s, t;
    for(int i = 0; i < n; i++) { cin >> a[i]; if(a[i] == 0) s = i; }
    for(int i = 0; i < n; i++) { cin >> b[i]; if(b[i] == 0) t = i; }
    for(int i = 0; i < n; i++)
    {
        if(i == t) continue;
        int np = (i + 1) % n;
        if(np == t) np = (np + 1) % n;
        //cout << np << endl;
        next[b[i]] = b[np];
    }
    printf(same(s) ? "YES\n" : "NO\n");
    return 0;
}