#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

int main() {
  int n;
  cin >> n;
  ll a[n], b[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }
  ll maxv = 0;
  for (int i = 0; i < n; i++) {
    maxv = max(a[i]+4*b[i], maxv);
  }
  ll ans = 0;
  for (int i = 0; i < n; i++) {
    if ((maxv-(a[i]+4*b[i]))%2) {
      std::cout << -1 << std::endl;
      return 0;
    }else {
      ans += (maxv-(a[i]+4*b[i]))/2;
    }
  }
  std::cout << ans << std::endl;
}