#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    int n;cin>>n;
    vector<ll> x(n),y(n);
    rep(i,n) cin>>x[i]>>y[i];

    auto D=[&](int i,int j){
        return (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
    };

    int res=0;
    vector<bool> alive(n,true);
    bool upd=true;
    while(upd){
        upd=false;
        ll d=LINF;
        rep(i,n)if(alive[i]){
            for(int j=i+1;j<n;j++)if(alive[j]){
                chmin(d,D(i,j));
            }
        }

        rep(i,n)if(alive[i]){
            for(int j=i+1;j<n;j++)if(alive[j]){
                if(D(i,j)==d){
                    upd=true;
                    if(i==0){
                        res++;
                        alive[j]=false;
                    }else{
                        alive[i]=false;
                        alive[j]=false;
                    }
                }
            }
        }
    }
    cout<<res<<endl;
    return 0;
}