#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
struct frac{
	ll p,q;
	inline frac(){p=0;q=1;}
	inline frac(ll x){p=x;q=1;}
	inline frac(ll x,ll y){
		ll d=__gcd(x,y);p=x/d;q=y/d;
		if (q<0) p=-p,q=-q;
	}
	frac operator + (const frac &x){return frac(p*x.q+q*x.p,q*x.q);}
	frac operator - (const frac &x){return frac(p*x.q-q*x.p,q*x.q);}
	frac operator * (const frac &x){return frac(p*x.p,q*x.q);}
	frac operator / (const frac &x){return frac(p*x.q,q*x.p);}
	bool operator < (const frac &x)const{return (__int128)p*x.q<(__int128)q*x.p;}
//	bool operator == (const frac &x)const{return p*x.q==q*x.p;}
//	bool operator > (const frac &x)const{return p*x.q>q*x.p;}
	void print(){
		cout << (long long)p << "/" << (long long)q;	
	}
};
struct point{
	frac x,y;
	point operator + (const point &k){return (point){x+k.x,y+k.y};}
	point operator - (const point &k){return (point){x-k.x,y-k.y};}
	point operator * (frac k){return (point){x*k,y*k};}
	point operator / (frac k){return (point){x/k,y/k};}
	frac abs2(){return x*x+y*y;}
	frac dis2(point k){return ((*this)-k).abs2();}
	void print(){
		cout << "(";
		x.print();
		cout << ",";
		y.print();
		cout << ") ";
	}
};

const int maxn=4000;

int n;
point a[maxn+50];
int sz[maxn+50];
frac d[maxn+50][maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i=1;i<=n;i++){
		int x,y;
		cin >> x >> y;
		a[i]=(point){frac(x),frac(y)};	
	}
	set<tuple<frac,int,int>> s;
	for (int i=1;i<=n;i++) sz[i]=1;
	int id=n;
	for (int i=1;i<=n;i++){
		for (int j=i+1;j<=n;j++){
			d[i][j]=d[j][i]=a[i].dis2(a[j]);
			s.emplace(d[i][j],i,j);	
		}
	}
	for (int cnt=1;cnt<=n-1;cnt++){
		if (s.empty()) break;
		
		auto tmp=*(s.begin());
		int x=get<1>(tmp);
		int y=get<2>(tmp);
		int sx=sz[x];
		int sy=sz[y];
		sz[++id]=sx+sy;
		
		for (int i=1;i<id;i++) if (sz[i]!=0){
			int l=i,r=x;
			if (l>r) swap(l,r);
			if (l==r) continue;
			auto it=s.find(make_tuple(d[l][r],l,r));
			if (it!=s.end()) s.erase(it);
		}
		sz[x]=0;
		for (int i=1;i<id;i++) if (sz[i]!=0){
			int l=i,r=y;
			if (l>r) swap(l,r);
			if (l==r) continue;
			auto it=s.find(make_tuple(d[l][r],l,r));
			if (it!=s.end()) s.erase(it);
		}
		sz[y]=0;
		
		for (int i=1;i<id;i++) if (sz[i]!=0){
			d[i][id]=d[id][i]=(d[i][x]*sx+d[i][y]*sy)/(sx+sy);
			s.emplace(d[i][id],i,id);
		}
	//	cout << "sz[id] : ";
		cout << sz[id] << "\n";
		/*
		cout << "id : " << id << endl;
		for (int i=1;i<=id;i++) a[i].print();
		cout << endl;
		for (int i=1;i<=id;i++) cout << sz[i] << " ";
		cout << endl;
		for (auto [x,i,j]:s){
			cout << "dis2,i,j : ";
			x.print();
			cout << " " << i << " " << j << endl;	
		}
		*/
	}
	return 0;
}