#include <bits/stdc++.h>
using namespace std;
long long int em(long long int x, long long int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return em((x % 1000000007 * x % 1000000007) % 1000000007, n / 2);
  else
    return (x % 1000000007 *
            em((x % 1000000007 * x % 1000000007) % 1000000007, (n - 1) / 2)) %
           1000000007;
}
int32_t main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, i, j, k, l;
  cin >> n;
  long long int a[n + 1], b[n + 1];
  for (long long int i = (long long int)0; i < (long long int)n; i++)
    cin >> a[i];
  for (long long int i = (long long int)0; i < (long long int)n; i++)
    cin >> b[i];
  vector<long long int> d1, d2;
  for (long long int i = (long long int)1; i < (long long int)n; i++) {
    d1.push_back(a[i] - a[i - 1]);
    d2.push_back(b[i] - b[i - 1]);
  }
  sort(d1.begin(), d1.end());
  sort(d2.begin(), d2.end());
  if (a[0] != b[0] || a[n - 1] != b[n - 1] || d1 != d2)
    cout << "No"
         << "\n";
  else
    cout << "Yes"
         << "\n";
}
