#include <bits/stdc++.h>

using namespace std;

template<ranges::range T,
          class = enable_if_t<!is_convertible_v<T, string_view>>>
istream& operator>>(istream &s, T &&v) {
    for (auto &&x : v) s >> x;
    return s;
}
template<ranges::range T,
          class = enable_if_t<!is_convertible_v<T, string_view>>>
ostream& operator<<(ostream &s, T &&v) {
    for (auto &&x : v) s << x << ' ';
    return s;
}

#ifdef LOCAL
template<class... T> void dbg(T... x) {
    char e{};
    ((cerr << e << x, e = ' '), ...);
}
#define debug(x...) dbg(#x, '=', x, '\n')
#else
#define debug(...) ((void)0)
#endif
#define ff first
#define ss second
#define all(v) (v).begin(), (v).end()

template<class T> bool chmin(T &a, T b) { return (b < a) and (a = b, true); }
template<class T> bool chmax(T &a, T b) { return (a < b) and (a = b, true); }
template<class T> inline constexpr T inf = numeric_limits<T>::max() / 2;

using i64 = long long;

void solve() {
    int n;
    cin >> n;

    vector<int> A(n), B(n);
    cin >> A >> B;

    vector<set<int>> pos(n + 1);

    auto cal = [n, &pos](auto A, auto B) -> int {
        A.insert(A.end(), all(A));
        B.insert(B.end(), all(B));

        for (int i = 1; i <= n; i++) pos[i].clear();
        for (int i = 0; i < n * 2; i++)
            pos[B[i]].insert(i);

        vector<int> pre(n * 2), suf(n * 2);
        for (int i = 0; i < n * 2; i++) {
            if (A[i] == B[i]) {
                pre[i] = 1 + (i == 0 ? 0 : pre[i - 1]);
            } else {
                pre[i] = 0;
            }
        }
        for (int i = n * 2 - 2; i >= 0; i--) {
            if (A[i + 1] == B[i]) {
                suf[i] = 1 + (i == n * 2 - 2 ? 0 : suf[i + 1]);
            } else {
                suf[i] = 0;
            }
        }
        if (ranges::max(pre) >= n) return 0;
        int ret = inf<int>;
        for (int i = 0; i < n; i++) {
            int r = i + suf[i];
            int l = i + n - 1 - pre[i + n - 1];
            if (l <= r) {
                auto it = pos[A[i]].lower_bound(l);
                if (it != pos[A[i]].end() and *it <= r) {
                    chmin(ret, *it - i);
                }
            }
        }
        return ret;
    };

    int ans = inf<int>;
    for (int i = 0; i < n; i++) {
        chmin(ans, i * (n - 1) + cal(A, B));
        rotate(A.begin(), A.begin() + 1, A.end());
    }
    for (int i = 0; i < n; i++) {
        chmin(ans, i * (n - 1) + cal(B, A));
        rotate(A.begin(), A.begin() + n - 1, A.end());
    }

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

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    solve();
    return 0;
}