#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>

using namespace std;
typedef long long ll;

int main(){
    int n;
    ll a,b,S[1000],maxS=0,ans=0;
    
    scanf("%d",&n);
    
    for(int i=0;i<n;i++){
        scanf("%lld%lld",&a,&b);
        
        S[i]=a+4*b;
        maxS=max(maxS,S[i]);
    }
    
    for(int i=0;i<n;i++){
        if((maxS-S[i])%2){
            puts("-1");
            return 0;
        }
        
        ans+=(maxS-S[i])/2;
    }
    
    
    printf("%lld\n",ans);
    
    
    return 0;
}