#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
const int M=2e5+5;
const ull seed=1e8+7,pri=10001107;
ull base[M],pw[M];
int n;
struct Edge{
	int a,b;
};
int head[M],asdf;
struct edge{
	int to,nxt,id;
}G[M<<1];
void add_edge(int a,int b,int c){
	G[++asdf].to=b;
	G[asdf].id=c;
	G[asdf].nxt=head[a];
	head[a]=asdf;
}
bool mark[M];
int par[M];
int get_fa(int x){
	if(par[x]==x)return x;
	return par[x]=get_fa(par[x]);
}
int fa[M],ID[M],dep[M];
void dfs1(int x,int f){
	fa[x]=f;
	dep[x]=dep[f]+1;
	for(int i=head[x];i;i=G[i].nxt){
		int y=G[i].to;
		if(y==f)continue;
		ID[y]=G[i].id;
		dfs1(y,x);
	}
}
vector<int>get_cir(int x,int y){
	vector<int>lx;
	vector<int>ly;
	while(x!=y){
		if(dep[x]>=dep[y]){
			lx.push_back(x);
			mark[ID[x]]=1;
			x=fa[x];
		}else {
			ly.push_back(y);
			mark[ID[y]]=1;
			y=fa[y];
		}
	}
	lx.push_back(x);
	for(int i=(int)ly.size()-1;i>=0;i--){
		lx.push_back(ly[i]);
	}
	return lx;
}
int sz[M];
ull hs[M];
void dfs(int x,int f){
	sz[x]=1;
	hs[x]=0;
	vector<ull>son;
	for(int i=head[x];i;i=G[i].nxt){
		int y=G[i].to;
		if(y==f)continue;
		if(mark[G[i].id])continue;
		dfs(y,x);
		sz[x]+=sz[y];
		son.push_back(hs[y]);
	}
	if(son.size()>0){
		sort(son.begin(),son.end());
		for(int i=0;i<son.size();i++){
			hs[x]+=son[i]*base[i];
		}
		hs[x]*=sz[x];
	}else {
		hs[x]=1;
	}
}

vector<ull>solve(vector<Edge>&E){
	//clear
	asdf=0;
	for(int i=1;i<=n;i++)head[i]=0;
	int len=E.size();
	for(int i=0;i<len;i++)mark[i]=0;
	for(int i=1;i<=n;i++)par[i]=i;
	
	int eid=-1;
	for(int i=0;i<len;i++){
		int a=E[i].a;
		int b=E[i].b;
		int x=get_fa(a);
		int y=get_fa(b);
		if(x==y){
			eid=i;
			continue;
		}
		par[x]=y;
		add_edge(a,b,i);
		add_edge(b,a,i);
	}
	dfs1(1,0);
	vector<int>pot=get_cir(E[eid].a,E[eid].b);
	vector<ull>Ans;
	for(int i=0;i<pot.size();i++){
		dfs(pot[i],0);
		Ans.push_back(hs[pot[i]]);
	}
	return Ans;
}
//typedef unsigned long long ull;
ull qz[M];
bool check(vector<ull>&A,vector<ull>&B){
	if(A.size()!=B.size())return 0;
	int n=A.size();
	ull goal=0;
	for(int i=0;i<n;i++){
		goal=goal*pri+A[i];
	}
	for(int i=0;i<n;i++){
		if(i>0)qz[i]=qz[i-1]*pri;
		else qz[i]=0;
		qz[i]+=B[i];
	}
	for(int i=n;i<2*n;i++){
		qz[i]=qz[i-1]*pri+B[i-n];
		if(qz[i]-qz[i-n]*pw[n]==goal)return 1;
	}
	return 0;
}
int main(){
	//init
	base[0]=1;
	pw[0]=1;
	for(int i=1;i<M;i++){
		base[i]=base[i-1]*seed;
		pw[i]=pw[i-1]*pri;
	}

	scanf("%d",&n);
	vector<Edge>G1;
	for(int i=1;i<=n;i++){
		int a,b;
		scanf("%d %d",&a,&b);
		G1.push_back({a,b});
	}
	vector<Edge>G2;
	for(int i=1;i<=n;i++){
		int a,b;
		scanf("%d %d",&a,&b);
		G2.push_back({a,b});
	}
	vector<ull>A=solve(G1);
	vector<ull>B=solve(G2);
//	for(auto x:A)printf("%llu ",x);
//	printf("\n");
//	for(auto x:B)printf("%llu ",x);
//	printf("\n");
	bool flag1=check(A,B);
	reverse(B.begin(),B.end());
//	for(auto x:A)printf("%llu ",x);
//	printf("\n");
//	for(auto x:B)printf("%llu ",x);
//	printf("\n");
	bool flag2=check(A,B);
	if(flag1||flag2){
		printf("Yes\n");
	}else {
		printf("No\n");
	}
	return 0;
}