#include <iostream>

using namespace std;

typedef long long ll;

int main() {
    ll n;
    cin >> n;
    ll length[n];
    ll maxLength = 0;
    ll sum = 0;
    for (ll i = 0; i < n; i++) {
        int space, tab;
        cin >> space >> tab;
        length[i] = space + 4 * tab;
        if (i > 0 && ((length[i - 1] ^ length[i]) & 1) == 1) {
            cout << -1 << endl;
            return 0;
        }
        maxLength = max(maxLength, length[i]);
        sum += length[i];
    }
    cout << (maxLength * n - sum) / 2 << endl;
    return 0;
}