#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <tuple>

using namespace std;

int main(){
    int n,ans=0;
    cin>>n;
    vector<int> x(n),y(n),kil(n,0);
    priority_queue<tuple<int,int,int>,vector<tuple<int,int,int>>,greater<tuple<int,int,int>>> q;

    for(int i=0;i<n;i++) cin>>x[i]>>y[i];
    
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            int xi,yi,xj,yj;
            xi=x[i],yi=y[i],xj=x[j],yj=y[j];
            q.push(make_tuple(pow(xi-xj,2)+pow(yi-yj,2),i,j));
        }
    }
    while(q.size()){
        int d,i,j;
        tie(d,i,j)=q.top();q.pop();
        if(kil[i]||kil[j]) continue;
        if(i!=0&&j!=0){
            kil[i]=1;
            kil[j]=1;
        }else{
            kil[j]=1;
            ans++;
        }
    }
    cout<<ans<<endl;
    return 0;
}