// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
constexpr inline int lg2(int64 x) { return x == 0 ? -1 : sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
constexpr inline int p2ceil(int64 x) { return 1 << (lg2(x - 1) + 1); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
inline void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
inline void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }
inline int mod(int x) { return x >= MOD ? x - MOD : x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n;
  cin >> n;
  vector<vector<int>> a(n), b(n);
  for (int i = 0; i < n; ++i) {
    int x, y;
    cin >> x >> y;
    --x; --y;
    a[x].push_back(y);
    a[y].push_back(x);
  }
  for (int i = 0; i < n; ++i) {
    int x, y;
    cin >> x >> y;
    --x; --y;
    b[x].push_back(y);
    b[y].push_back(x);
  }
  trace("read done");
  auto solve = [&](const vector<vector<int>>& a) -> vector<int> {
    vector<int> pre(n, -1);
    vector<int> ret;
    function<bool(int, int)> dfs =
    [&](int u, int parent) -> bool {
      for (auto& v : a[u]) {
        if (v == parent) continue;
        if (pre[v] >= 0) {
          trace(u, v);
          for (int t = u; t != v; t = pre[t]) ret.push_back(t);
          ret.push_back(v);
          trace(ret);
          return true;
        }
        pre[v] = u;
        if (dfs(v, u)) return true;
      }
      return false;
    };
    pre[0] = 0;
    dfs(0, -1);
    return ret;
  };
  auto A = solve(a);
  auto B = solve(b);

  auto get_tree =
    [&](const vector<int>& A, const vector<vector<int>>& a) {
      vector<bool> vis(n);
      for (auto& x : A) vis[x] = 1;
      map<vector<int>, int> id;
      function<int(int, int)> dfs =
        [&](int u, int parent) {
          vector<int> child;
          for (auto& v : a[u]) {
            if (v == parent || vis[v]) continue;
            child.push_back(dfs(v, u));
          }
          sort(child.begin(), child.end());
          // int64 s = 1;
          // for (auto& x : child) s = s * 2345343LL + x;
          if (id.find(child) == id.end()) {
            id.emplace(child, SZ(id) + 1);
          }
          return id[child];
        };
      vector<int> ret;
      for (auto& x : A) {
        id.clear();
        ret.push_back(dfs(x, -1));
      }
      sort(ret.begin(), ret.end());
      return ret;
    };

  auto HA = get_tree(A, a);
  auto HB = get_tree(B, b);
  trace(HA, HB);
  cout << (HA == HB ? "Yes" : "No") << '\n';
  return 0;
}