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

void justDoIt();

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    justDoIt();
    return 0;
}

const int INF = 1e9 + 20;
const long long BASE = 1e6 + 3;
const long long MOD = 1e9 + 7;

void calc(vector<long long>& a, vector<vector<long long>>& shifts) {
    int n = a.size();
    // shifts[i][j] is clockwise
    for (int i = 0; i < n; i++) {
        vector<long long> rem(n - 1);
        for (int j = 0; j < n - 1; j++) {
            rem[j] = a[(i + 1 + j) % n];
        }
        long long h = 0;
        for (int j = 0; j < n - 1; j++) {
            h = (h * BASE + rem[j]) % MOD;
        }
        long long pw = 1;
        for (int j = 0; j < n - 2; j++) {
            pw = pw * BASE % MOD;
        }
        for (int j = 0; j < n - 1; j++) {
            shifts[i][j] = h;
            h = (h + MOD - (pw * rem[j]) % MOD) % MOD;
            h = (h * BASE + rem[j]) % MOD;
        }
    }
}

int solve(vector<long long> a, vector<long long> b) {
    int n = a.size();
    if (n == 1) {
        if (a[0] == b[0]) {
            return 0;
        }
        else {
            return INF;
        }
    }
    vector<vector<long long>> shiftsA(n, vector<long long>(n - 1));
    vector<vector<long long>> shiftsB(n, vector<long long>(n - 1));
    calc(a, shiftsA);
    calc(b, shiftsB);
    vector<map<long long, int>> f(n);
    for (int i = 0; i < n; i++) {
        for (int j = 1; j < n - 1; j++) {
            f[i][shiftsB[i][j]] = n - 1 - j;
        }
        f[i][shiftsB[i][0]] = 0;
    }
    int res = INF;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int dist = (j + n - i) % n;
            long long h = shiftsA[i][dist % (n - 1)];
            auto it = f[j].find(h);
            if (it != f[j].end()) {
                res = min(res, dist + (it->second) * n);
            }
        }
    }
    return res;
}

void justDoIt() {
    int n;
    cin >> n;
    vector<long long> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    int res = INF;
    for (int iter = 0; iter < 2; iter++) {
        res = min(res, solve(a, b));
        reverse(a.begin(), a.end());
        reverse(b.begin(), b.end());
    }
    if (res == INF) {
        cout << -1;
        return;
    }
    else {
        cout << res;
        return;
    }
}