#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x),end(x)
#ifdef CKISEKI
#include <experimental/iterator>
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int inf = 1e9;

int solve(int n, const auto &a, const auto &b) {
  if (a == b) return 0;

  vector<int> A(n * 2), B(n * 2);
  for (int i = 0; i < n; i++) {
    A[i] = a[i] == b[i];
    B[i] = a[i + 1 < n ? i + 1 : 0] == b[i];
  }
  for (int i = n; i < n * 2; i++) A[i] = A[i - n];
  for (int i = n; i < n * 2; i++) B[i] = B[i - n];

  vector<int> dpB(n * 2), dpA(n * 2);
  for (int i = n * 2 - 1; i >= 0; i--) {
    dpB[i] = (i + 1 < n * 2 ? dpB[i + 1] : 0) + 1;
    if (!B[i]) dpB[i] = 0;
  }

  vector<vector<int>> qs(n * 3);
  vector<int> cnt(n * 3);
  {
    int j = 0;
    for (int i = 0; i < n * 2; i++) {
      dpA[i] = j;
      if (i >= n) {
        ++cnt[i + n - j - 1];
        ++cnt[i - j - 1];
        // qs[i + n - j - 1].emplace_back(i);
        // qs[i - j - 1].emplace_back(i - n);
      }
      if (!A[i])
        j = 0;
      else
        ++j;
    }
  }

  for (int i = 0; i < n * 3; i++)
    qs[i].reserve(cnt[i]);

  for (int i = 0; i < n * 2; i++) {
    int z = n - dpA[i < n ? i + n : i];
    qs[i + z - 1].emplace_back(i);
  }

  vector<int> idx(n, 1e9);
  /* vector<vector<int>> idx(n); */
  /* for (int i = 0; i < n * 2; i++) */
  /*   idx[b[i < n ? i : i - n]].push_back(i); */

  orange(all(a));
  orange(all(b));
  orange(all(dpA));
  orange(all(dpB));

  int ans = inf;

  for (int x = n * 2 - 1; x >= 0; x--) {
    idx[b[x < n ? x : x - n]] = x;
    for (int i : qs[x]) {
      int z = idx[a[i < n ? i : i - n]];
      if (z <= i + dpB[i])
        ans = min(ans, z - i);
    }
  }

  return ans;
}

signed main() {
  cin.tie(nullptr) -> sync_with_stdio(false);

  int n;
  cin >> n;
  vector<int> a(n), b(n);
  for (int &x : a) cin >> x, --x;
  for (int &x : b) cin >> x, --x;

  /* debug(solve(n, a, b)); */
  /* return 0; */

  int ans = inf;
  for (int k = 0; k < n; k++) {
    ans = min(ans, k * (n - 1) + solve(n, a, b));
    rotate(a.begin(), a.begin() + 1, a.end());
  }
  ranges::reverse(a);
  ranges::reverse(b);
  for (int k = 0; k < n; k++) {
    ans = min(ans, k * (n - 1) + solve(n, a, b));
    rotate(a.begin(), a.begin() + 1, a.end());
  }

  if (ans == inf)
    ans = -1;
  cout << ans << '\n';
}