#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;

void Hollwo_Pelw();

signed main(){
#ifndef hollwo_pelw_local
	if (fopen(".inp", "r"))
		assert(freopen(".inp", "r", stdin)), assert(freopen(".out", "w", stdout));
#else
	using namespace chrono;
	auto start = steady_clock::now();
#endif
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
	int testcases = 1;
	// cin >> testcases;
	for (int test = 1; test <= testcases; test++){
		// cout << "Case #" << test << ": ";
		Hollwo_Pelw();
	}
#ifdef hollwo_pelw_local
	auto end = steady_clock::now();
	cout << "\nExecution time : " << duration_cast<milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}

const int N = 3005;

int n, a[N], b[N], c[N], match[N], res = 2e9;


inline int get(int l, int r) {
	if (l <= r)
		return match[r] - (l ? match[l - 1] : 0);
	return get(l, n - 1) + get(0, r);
}

void solve() {
	for (int p = 0; p < 2; p++) {
		for (int i = 0; i < n; i++)
			c[i] = a[(i + p) % n];
		
		// cout << "P = " << p << '\n';
		// for (int i = 0; i < n; i++)
		// 	cout << c[i] << " \n"[i == n - 1];
		// for (int i = 0; i < n; i++)
		// 	cout << b[i] << " \n"[i == n - 1];
		

		int move = (n - 1) * p;

		vector<int> pos;
		for (int i = 0; i < n; i++) {
			if (b[i] != c[i])
				pos.push_back(i);
			match[i] = c[(i + 1) % n] == b[i] + (i == 0 ? 0 : match[i - 1]);
		}

		for (int i = 0; i < (int) pos.size(); i++) {
			int l = pos[(i + 1) % pos.size()], r = pos[i] % n; // check if path from l -> r can make b == c

			// cout << l << " -> " << r << '\n';

			int diff = (r - l + n) % n;
			// cout << get(l + r) + (c[l] == b[r]) << diff << '\n';

			if (get(l, (r + n - 1) % n) + (c[l] == b[r]) == diff + 1)
				res = min(res, diff + move);

		}

		if (pos.empty())
			res = min(res, move);
	}
}

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

	for (int turn = 2; turn --; ) {
		solve();
		reverse(a, a + n);
		reverse(b, b + n);
	}
	
	cout << (res == 2e9 ? -1 : res) << '\n';
}