#include<bits/stdc++.h>

using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")

#define int long long 
#define F first 
#define S second 
#define pb push_back

const int mol=998244353;

int a[3005], b[3005], now[3005];

int n;
int ans=1e9;

void calc(){
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            now[j]=a[(j+i)%n];
        }
        int l=n, r=-1;
        for(int j=0;j<n;j++){
            if(now[j]!=b[j]){
                r=j;
                if(l==n) l=j;
            }
        }

        if(l==n) {
            ans=min(ans, i*n);
            continue;
        }

        bool ok=1;
        if(now[l]!=b[r]) ok=0;
        for(int i=l+1;i<=r;i++){
            if(now[i]!=b[i-1]) ok=0;
        } 
        if(ok) ans=min(ans, r-l+i*(n-1));
        ok=1;
        if(now[r]!=b[l]) continue;
        for(int i=r+1;i<n;i++){
            if(now[i]!=b[i-1]) ok=0;
        }
        if(now[0]!=b[n-1]) ok=0;
        for(int i=1;i<=l;i++){
            if(now[i]!=b[i-1]){
                ok=0;
            }
        }
        if(ok) ans=min(ans, i*(n-1)+l+n-r);



    }
}

//1 2 2 1 1 2
//1 1 2 2 2 1

void solve(){
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i];
    for(int i=0;i<n;i++) cin>>b[i];

    calc();
    reverse(a, a+n);
    reverse(b, b+n);

    calc();
    if(ans==1e9) ans=-1;
    cout<<ans<<"\n";
}

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

    // int t;
    // cin>>t;
    // while(t--)
    solve();
    return 0;
}