#include<bits/stdc++.h>
using std::cin;
using std::cout;
const int N = 300005;
using ll = long long;
using u64 = unsigned long long;
using pr = std::pair<int, int>;
const ll inf = 1e18;

std::map<std::vector<int>, int> map;
int cnt;

int get(std::vector<int> v) {
	if(map.count(v)) return map[v];
	return map[v] = ++cnt;
}

int n;

const int mod = 920028467;
const int base = 124124;

struct graph {
	std::vector<int> go[N];
	std::vector<int> st, cyc;
	int vis[N];
	void dfs0(int x, int fa = 0) {
		vis[x] = 1;
		st.push_back(x);
		for(int v : go[x]) if(v != fa) {
			if(!vis[v]) {
				dfs0(v, x);
			} else {
				if(!cyc.size()) cyc = std::vector<int>(find(st.begin(), st.end(), v), st.end());
			}
		}
		st.pop_back();
	}
	int h[N];
	void dfs1(int x, int fa = 0) {
		vis[x] = 1;
		std::vector<int> son;
		for(int v : go[x]) if(!vis[v]) {
			dfs1(v);
			son.push_back(h[v]);
		}
		sort(son.begin(), son.end());
		h[x] = ::get(son);
	}
	int w[N * 2];
	std::vector<int> get() {
		for(int i = 1, u, v;i <= n;++i) {
			cin >> u >> v;
			go[u].push_back(v);
			go[v].push_back(u);
		}
		dfs0(1);
		memset(vis, 0, sizeof(vis));
		for(int x : cyc) {
			vis[x] = 1;
		}
		std::vector<int> hs;
		for(int x : cyc) {
			dfs1(x);
			hs.push_back(h[x]);
		}
		return hs;
	}
} g1, g2;
std::vector<int> geths(std::vector<int> hs) {
	std::vector<int> w(hs.size() * 2 + 1);
	int pw = 1;
	for(int i = 0;i < (int) hs.size();++i) pw = (u64) pw * base % mod;
	for(int i = 1;i < (int) hs.size() * 2;++i) {
		w[i] = ((u64) w[i - 1] * base + hs[(i - 1) % hs.size()]) % mod;
	}
	std::vector<int> ans;
	for(int i = hs.size();i < (int) hs.size() * 2;++i) {
		ans.push_back((w[i] + u64(mod - pw) * w[i - hs.size()]) % mod);
	}
	return ans;
}

int chk(std::vector<int> a, std::vector<int> b) {
	if(a.size()!=b.size()) return 0;
	auto it = find(b.begin(),b.end(),a[0]);
	if(it==b.end())return 0;
	rotate(b.begin(),it,b.end());
	return a==b;
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	auto A = g1.get();
	auto B = g2.get();
	auto rB = B;
	reverse(rB.begin(), rB.end());

	if(chk(A,B)||chk(A,rB)) {
		cout << "Yes" << '\n';
	} else {
		cout << "No" << '\n';
	}


}