#include<bits/stdc++.h>
#define rep2(i,j,k) for(ll i = ll(j); i < ll(k); i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i = ll(j)-1; i >= ll(k); i--)
#define rrep(i,k) rrep2(i,k,0)
#define eb emplace_back
#define SZ(a) ll(a.size())
#define all(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
const ll inf = LLONG_MAX/4;
bool chmin(auto& a, auto b) {return a>b ? a=b, 1 : 0;}
bool chmax(auto& a, auto b) {return a<b ? a=b, 1 : 0;}

int main(){
	cin.tie(0) -> sync_with_stdio(0);
	int n;
	cin >> n;
	vl A(n), b(n);
	rep(i, n) cin >> A[i];
	rep(i, n) cin >> b[i];
	rep(i, n) b.eb(b[i]);
	ll ans = inf;
	rep(_, 2) {
		rep(m, n) {
			vl a;
			rep(i, 2) {
				a.insert(a.end(), A.begin()+m, A.end());
				a.insert(a.end(), A.begin(), A.begin()+m);
			}
			vvl lb(2, vl(2*n+1));
			rep(k, 2) {
				lb[k][k] = k;
				rep2(i, k, 2*n) {
					if(a[i] == b[i-k]) lb[k][i+1] = lb[k][i];
					else lb[k][i+1] = i+1;
				}
			}
			if(lb[0].back() == 0) {
				chmin(ans, m*(n-1));
				continue;
			}
			rep(i, n) {
				ll r = lb[0][i+n];
				assert(r > i);
				if(lb[1][r] > i+1) continue;
				if(a[i] != b[r-1]) continue;
				chmin(ans, m*(n-1) + (r-i-1));
			}
		}
		reverse(all(A));
	}
	cout << (ans == inf ? -1 : ans) << endl;
}