#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
	int N;
	cin>>N;
	vector<int> A(2*N);
	for(int i=0;i<2*N;i++) cin>>A[i];
	bool ans = false;
	for(int i=0;i<2*N;i++){
		bool p = true;
		for(int j=0;j<N;j++)if(A[(i+j)%(2*N)] != -1 && A[(i+N-1-j)%(2*N)] != -1 && A[(i+j)%(2*N)] != A[(i+N-1-j)%(2*N)]) p = false;
		ans |= p;
		p = true;
		for(int j=0;j<=N;j++)if(A[(i+j)%(2*N)] != -1 && A[(i+N-j)%(2*N)] != -1 && A[(i+j)%(2*N)] != A[(i+N-j)%(2*N)]) p = false;
		ans |= p;
	} 
	cout<<(ans ? "Yes" : "No")<<endl;
}