#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int MAXN = 200'001;

int a[MAXN], b[MAXN], tree[2*MAXN], n;

void upd(int u) {
    tree[u += n]++;
    for (u /= 2; u >= 1; u /= 2) {
        tree[u] = tree[2*u] + tree[2*u+1];
    }
}

int qry(int l, int r) {
    l += n; r += n;
    int ans = 0;
    while (l <= r) {
        if (l % 2 == 1) ans += tree[l++];
        if (r % 2 == 0) ans += tree[r--];
        l /= 2; r /= 2;
    }
    return ans;
}

int main(){
    cin.tie(0); cin.sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];

    if (a[1] != b[1] || a[n] != b[n]) {
        cout << "-1\n";
    } else {
        map<int, queue<int>> x;
        for (int i = 2; i <= n; i++) {
            int s = b[i-1] + b[i];
            if (i & 1) s *= -1;
            x[s].push(i);
        }
        ll ans = 0;
        for (int i = 2; i <= n; i++) {
            int s = a[i-1] + a[i];
            if (i & 1) s *= -1;
            if (x[s].empty()) {
                cout << "-1\n";
                return 0;
            }
            upd(x[s].front());
            ans += qry(x[s].front()+1, n);
            x[s].pop();
        }
        cout << ans << "\n";
    }
    return 0;
}