#include <bits/stdc++.h>
using namespace std;
int re() {
  int ret = 0, f = 1;
  char ch = getchar();
  while (ch < '0' && '9' < ch) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while ('0' <= ch && ch <= '9') {
    ret = ret * 10 + ch - '0';
    ch = getchar();
  }
  return ret * f;
}
int a[200100], b[200100], c[200100], d[200100];
int main() {
  int n;
  n = re();
  for (int i = 1; i <= n; i++) a[i] = re();
  for (int i = 1; i <= n; i++) b[i] = re();
  bool g = true;
  if (a[1] != b[1] || a[n] != b[n]) g = false;
  for (int i = 1; i < n; i++) c[i] = a[i + 1] - a[i];
  for (int i = 1; i < n; i++) d[i] = b[i + 1] - b[i];
  sort(c + 1, c + n);
  sort(d + 1, d + n);
  for (int i = 1; i < n; i++)
    if (c[i] != d[i]) g = false;
  if (g)
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}
