#include <bits/stdc++.h>

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#endif

#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define pb push_back
#define pi array<int, 2>
#define comp(v) (sort(all(v)), v.erase(unique(all(v)), v.end()))
#define lb(v, x) (lower_bound(all(v), x) - v.begin())
#define MIN(x, y) (x = min(x, y))

using namespace std;

#define int long long

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

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

    if(n == 1){
        cout << (a[0] == inb[0] ? 0 : -1);
        return 0;
    }
    else if(n == 2){
        if(a == inb) cout << 0;
        else if(a[0] == inb[1] && a[1] == inb[0]) cout << 1;
        else cout << -1;
        return 0;
    }

    int ans = (int)1e18;
    for(int rr = 0; rr < 2; ++rr){
        auto b = inb;
        for(int i = 0; i < n; ++i){
            b.pb(b[i]);
        }

        vector<vector<int>> pos(n);
        for(int i = 0; i < n * 2; ++i){
            pos[b[i]].pb(i);
        }

        auto sol2 = [&](vector<int> x){
            for(int i = 0; i < n; ++i) x.pb(x[i]);
            int same = 0;
            for(int i = 0; i < n; ++i){
                if(x[i] == b[i]){
                    same = 1;
                    break;
                }
            }
            if(!same) return (int)1e18;

            int sp = 0, rp = 0;
            int rv = (int)1e18;
            for(int i = n - 1; i >= 0; --i){
                if(x[i] != b[i]){
                    sp = i;
                    break;
                }
            }
            for(int i = 0; i < n; ++i){
                if(x[i + n - 1] != b[i + n - 1]) sp = i + n - 1;
                rp = max(rp, i);
                while(rp + 1 < n * 2 && b[rp] == x[rp + 1]){
                    ++rp;
                }

                int l = max(i + 1, sp), r = min(rp, i + n - 2);
                if(l <= r){
                    int p = lb(pos[x[i]], l);
                    if(p < sz(pos[x[i]]) && pos[x[i]][p] <= r){
                        // cout << i << ' ' << pos[x[i]][p] << endl;
                        MIN(rv, pos[x[i]][p] - i);
                    }
                }
            }
            return rv;
        };
        auto sol1 = [&](vector<int> x){
            for(int rep = 1; rep < n; rep += n - 2){
                for(int i = 0, now = 0; i < n; ++i){
                    MIN(ans, now + sol2(x));

                    now += n - 1;
                    rotate(x.begin(), x.begin() + rep, x.end());
                }
                if(n <= 2) break;
            }
        };
        sol1(a);

        reverse(all(a));
        reverse(all(inb));
    }

    if(ans == (int)1e18) ans = -1;
    cout << ans << '\n';

    // cout << clock() / (double)CLOCKS_PER_SEC;

    return 0;
}