8VC Venture Cup 2016 - Final Round (Div. 2 Edition) B. Island Puzzle

原题链接

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

有n个岛屿，除了一个岛屿上没有雕像之外，其他岛屿上都有，可以把一个岛屿上的雕塑搬到附近没有雕塑的岛屿上。

题中给出每个岛屿上的雕塑分布情况，问是否能经过移动能把雕塑的分布移动到理想的情况。

这道题其实就是不断把最后的岛屿上的雕像搬到第一个岛屿上去，观察是否和理想的雕塑分布情况是否相同。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define maxn 205
using namespace std;
typedef long long ll;

int k1[200005], k2[200005];
int main(){
	
	int n, j = 0, a;
	
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		scanf("%d", &a);
		if(a)
		 k1[j++] = a;
	}
	j = 0;
	for(int i = 0; i < n; i++){
		scanf("%d", &a);
		if(a)
		 k2[j++] = a;
	}
	int h;
	for(int i = 0; i < j; i++)
	  if(k1[i] == k2[0]){
	   h = i;
	   break;
      }
      int sign = 0;
	for(int i = h; i < j; i++)
	 if(k1[i] != k2[i-h]){
	 	sign = 1;
	 	break;
	 }
	for(int i = 0; i < h; i++)
	 if(k1[i] != k2[i+j-h]){
	 	sign = 1;
	 	break;
	 } 
	 if(sign)
	  puts("NO");
	 else
	  puts("YES");
	  
	 return 0; 
}