#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
long long int power(long long int a, long long int b, long long int m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long int t = power(a, b / 2, m) % m;
  t = (t * t) % m;
  if (b & 1) t = ((t % m) * (a % m)) % m;
  return t;
}
long long int modInverse(long long int a, long long int m) {
  return power(a, m - 2, m);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, j, k, l, n;
  cin >> n;
  long long int ar[n + 1], br[n + 1];
  vector<long long int> a, b;
  for (i = 1; i <= n; i++) {
    cin >> ar[i];
    if (ar[i] != 0) {
      a.push_back(ar[i]);
    }
  }
  for (i = 1; i <= n; i++) {
    cin >> br[i];
    if (br[i] != 0) {
      b.push_back(br[i]);
    }
  }
  for (i = 0; i < b.size(); i++) {
    if (b[i] == a[0]) break;
  }
  j = i;
  int fl = 1;
  for (i = 0; i < a.size(); i++, j++) {
    if (j == b.size()) j = 0;
    if (a[i] != b[j]) {
      fl = 0;
      break;
    }
  }
  if (fl)
    cout << "YES"
         << "\n";
  else
    cout << "NO"
         << "\n";
  return 0;
}
