#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int INF = 1e9;

VI zFunction(const VI& s)
{
	int n = SZ(s);
	VI z(n);
	int l = 0, r = 0;
	FOR(i, 1, n)
	{
		z[i] = 0;
		if (i <= r)
			z[i] = min(r - i + 1, z[i - l]);
		while (i + z[i] < n && s[i + z[i]] == s[z[i]])
			z[i]++;
		if (i + z[i] - 1 > r)
		{
			r = i + z[i] - 1;
			l = i;
		}
	}
	return z;
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	int n;
	cin >> n;
	VI a(n), b(n);
	for (int& x : a)
		cin >> x;
	for (int& x : b)
		cin >> x;
	VI c;
	int ans = INF;
	FOR(i, 0, n)
	{
		c.clear();
		FOR(j, 0, n - 1)
			c.PB(a[(i + j) % n]);
		VI d1 = c, d2 = c;
		reverse(ALL(d2));
		d1.PB(0);
		d1.insert(d1.end(), ALL(b));
		d1.insert(d1.end(), ALL(b));
		VI br = b;
		reverse(ALL(br));
		d2.PB(0);
		d2.insert(d2.end(), ALL(br));
		d2.insert(d2.end(), ALL(br));
		VI z1 = zFunction(d1), z2 = zFunction(d2);
		FOR(j, 0, n)
		{
			int x = z2[2 * n - j];
			if (z1[n + j] + x >= n - 1 && b[(n + j - 1 - x) % n] == a[(i + n - 1) % n])
			{
				ans = min(ans, (n - 1 - j) % (n - 1) * (n - 1) + max(0, n - 1 - x));
			}
		}
		b.PB(b[0]);
		b.erase(b.begin());
	}
	cout << (ans == INF ? -1 : ans) << "\n";
	return 0;
}