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

const int INF = 1e9;

int n, a[6060], b[6060], r[6060];

vector<int> find(int a[], int L, int R) {
    vector<int> re;
    for(int i=L;i<=R;i++) re.push_back(a[i]);
    return re;
}

int solve() {
    for(int i=1;i<=n;i++) a[n+i] = a[i], b[n+i] = b[i];
    r[n+n+1] = n+n;
    for(int i=n+n;i>=1;i--) r[i] = (a[i] == b[i] ? r[i+1] : i-1);

    int re = INF;
    for(int i=1;i<=n;i++) {
        int L = i, R = i+n-1;

        int M = r[L];
        if(a[M+1] == b[R] && find(a, M+2, R) == find(b, M+1, R-1)) re = min(re, R-M-1);
    }

    return re;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=n;i++) cin >> b[i];


    int ans = INF;
    for(int i=1;i<n;i++) {
        ans = min(ans, solve() + n*min(i-1, n-i));
        rotate(a+1, a+2, a+1+n);
    }
    rotate(a+1, a+2, a+1+n);
    reverse(a+1, a+1+n), reverse(b+1, b+1+n);
    for(int i=1;i<=n;i++) {
        ans = min(ans, solve() + n*min(i-1, n-i));
        rotate(a+1, a+2, a+1+n);
    }
    cout << (ans == INF ? -1 : ans);
}