#include <bits/stdc++.h>
#define ent '\n'
#define f first
#define s second
#define int long long

using namespace std;
typedef long long ll;
const int maxn = 1e6 + 12;
const int mod = 1e9 + 7;

int x[maxn], y[maxn];
int p[maxn];
int n, m, s;

int get(int x){
    if(p[x] == x) return x;
    return p[x] = get(p[x]);
}

int pos(int x, int y){
    return x * 1000 + y;
}

int lcm(int x, int y){
    return x / __gcd(x, y) * y;
}

void solve(){
    cin >> n;
    if(n <= 2){
        cout << "-1\n";
        return;
    }
    int mnx = 1e9, mny = 1e9;
    for(int i=1;i<=n;i++){
        cin >> x[i] >> y[i];
        x[i] += 305, y[i] += 305;
        mnx = min(mnx, x[i]);
        mny = min(mny, y[i]);
    }
    for(int i=0;i<1000;i++){
        for(int j=0;j<1000;j++){
            p[i*1000 + j] = i * 1000 + j;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            for(int dx=-101;dx<=201;dx++){
                for(int dy=-101;dy<=201;dy++){
                    p[get(pos(x[i] + dx, y[i] + dy))] = get(pos(x[j] + dx, y[j] + dy));
                }
            }
        }
    }
    set<int> s, t;
    for(int i=mnx;i<=mnx+200;i++){
        for(int j=mny;j<=mny+200;j++){
            s.insert(get(pos(i, j)));
        }
    }
    for(int i=mnx-50;i<=mnx+200;i++){
        for(int j=mny-50;j<=mny+200;j++){
            t.insert(get(pos(i, j)));
        }
    }
    if(s.size() != t.size()){
        cout << "-1\n";
    }
    else{
        cout << s.size() << ent;
    }
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}