#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

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

    auto solve = [&]() {
        int n;
        cin >> n;

        vector<int> a(n), b(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            a[i]--;
        }
        for (int i = 0; i < n; i++) {
            cin >> b[i];
            b[i]--;
        }

        constexpr int inf = 1e9;

        auto work = [&](vector<int> a, vector<int> b) {
            int ans = inf;
            vector<int> pref(2 * n + 1);
            for (int rep = 0; rep < n; rep++) {
                vector<int> pos;
                for (int i = 0; i < n; i++) {
                    if (a[i] != b[i]) {
                        pos.push_back(i);
                    }
                }
                for (int i = 0; i < 2 * n; i++) {
                    pref[i + 1] = pref[i] + (b[i % n] == a[(i + 1) % n]);
                }
                for (int i = 0; i < pos.size(); i++) {
                    int l = pos[(i + 1) % pos.size()], r = pos[i];
                    int dis = (r - l + n) % n;
                    if ((a[l] == b[r]) + pref[r > l ? r : r + n] - pref[l] == dis + 1) {
                        ans = min(ans, rep * (n - 1) + dis);
                    }
                }
                rotate(a.begin(), a.begin() + 1, a.end());
            }
            return ans;
        };

        int ans = work(a, b);
        reverse(a.begin(), a.end());
        reverse(b.begin(), b.end());
        ans = min(ans, work(a, b));
        
        if (ans == inf) {
            ans = -1;
        }

        cout << ans << '\n';
    };
    
    solve();
    
    return 0;
}