#include <bits/stdc++.h>

using namespace std;

const int N = 1000005;
int b[N], sz, vis[N], kk[N];
vector <int> G[N];
unordered_map <int, int> mp;

void dfs(int u, int start, bool flag = false) {
  if (start == u && flag) {
    return;
  }
  G[sz].push_back(u);
  vis[u] = 1;
  u = mp[u];
  dfs(u, start, 1);
}

void fail() {
  cout << "No\n";
  exit(0);
}

void check(int n) {
  vector <int> f(n + 1);
  bool good = 0;
    for (int i = 1; i <= n; ++i)
      f[i] = i;
    for (int j = 0; j < n + 1; ++j) {
      map <int, int> place;
      for (int i = 1; i <= n; ++i) {
        place[f[i]] = i;
        f[i] = mp[f[i]];
      }
      for (int i = 1; i <= n; ++i)
        cout << place[i] << ' ';
      cout << "\n";
    }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n; cin >> n;
  bool ans = 1;
  for (int i = 1; i <= n; ++i) {
    int x;
    cin >> x;
    mp[x] = i;
  }
  for (int i = 1; i <= n; ++i) {
    cin >> b[i];
  }
  sz = 0;
  for (int i = 1; i <= n; ++i) {
    if (vis[i] == 0) {
      sz++;
      G[sz].clear();
      dfs(i, i, 0);
    }
  }
  vector <long long> sdvs(sz + 1);
  long long T = 0;
  long long start = -1;
  for (int i = 1; i <= sz; ++i) {
    int nz = G[i].size();
    vector <int> h(nz);
    for (int j = 0; j < nz; ++j) {
      h[j] = b[G[i][j]];
    }
    bool good = 0;
    for (int j = 0; j < nz; ++j) {
      int s = 0;
      int ind = j;
      int pi = 0;
      while (s < nz && G[i][ind] == h[pi]) {
        pi++;
        ind++;
        ind %= G[i].size();
        s++;
      }
      if (s == nz) {
        good = 1, sdvs[i] = j;
        if (sdvs[i] == 0)
          sdvs[i] = G[i].size();
      }
    }
    if (good == 0) fail();
    if (G[i].size() > T) {
      T = G[i].size(), start = sdvs[i];
    }
  }
  long long lcm = 1;
  for (int i = 1; i <= sz; ++i) {
    lcm = (lcm * G[i].size()) / __gcd((long long)G[i].size(), lcm);
  }
  for (long long t = start; t <= lcm; t += T) {
    bool good = 1;
    for (int j = 1; j <= sz; ++j) {
      if (!(t >= sdvs[j] && (t - sdvs[j]) % G[j].size() == 0))
        good = 0;
    }
    if (good) {
      cout << "Yes\n";
      exit(0);
    }
  }
  fail();
  return 0;
}