#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#define per(i, l, r) for (int i = (r - 1); i >= (l); --i)
#define ALL(x) (x).begin(), (x).end()

int main() {
    int N;
    cin >> N;
    vector<int> H(N);
    for (auto &e : H)
        cin >> e;

    if (all_of(ALL(H), [](int v) { return abs(v) == 1; })) {
        vector<pair<int, int>> cp;
        int last = 0;
        rep (i, 0, N) {
            if (H[i] != H[last]) {
                cp.push_back({H[last], i - last});
                last = i;
            }
        }
        cp.push_back({H[last], N - last});
        int l = 0, r = (int)cp.size();
        rep (i, 0, (int)cp.size()) {
            if (cp[i].second % 2 == 1 and cp[i].first == -1)
                l = max(l, i);
            if (cp[i].second % 2 == 1 and cp[i].first == 1)
                r = min(r, i);
        }
        int cnt0l = 0, cnt0r = 0, cnt1l = 0, cnt1r = 0;
        rep (i, 0, l + 1) {
            if (cp[i].first == 1)
                cnt0l += cp[i].second;
            else
                cnt1l += cp[i].second;
        }
        rep (i, l + 1, (int)cp.size()) {
            if (cp[i].first == 1)
                cnt0r += cp[i].second;
            else
                cnt1r += cp[i].second;
        }
        int ans = 1 << 30;
        rep (i, l, r) {
            ans = min(ans, cnt0l + cnt1r);
            if (i != r - 1) {
                if (cp[i + 1].first == 1) {
                    cnt0l += cp[i + 1].second;
                    cnt1l -= cp[i + 1].second;
                } else if (cp[i + 1].first == -1) {
                    cnt0r += cp[i + 1].second;
                    cnt1r -= cp[i + 1].second;
                }
            }
        }
        if (ans == (1 << 30))
            ans = -1;
        cout << ans << endl;
    }
}