#include <bits/stdc++.h>
#include<random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
const lint MOD = 1e9 + 7, INF = 1e18;
lint dx[8] = { 0, -1, 1, 0, 1, -1, 1, -1 }, dy[8] = { 1, 0, 0, -1, -1, -1, 1, 1 };
typedef pair<long double, lint> Pa;
typedef pair<lint, plint> tlint;
struct edge {
	lint cost;
	lint u, v;
};

lint N, x[1000], y[1000];
priority_queue<tlint> que;
bool used[1000];
int main() {
	cin >> N;
	REP(i, N) {
		cin >> x[i] >> y[i];
		used[i] = false;
	}
	REP(i, N - 1) {
		FOR(j, i + 1, N) {
			que.push({ -(x[i] - x[j]) * (x[i] - x[j]) - (y[i] - y[j]) * (y[i] - y[j]), {i, j} });
		}
	}

	lint cnt = 0;
	while (!que.empty()) {
		plint tp = que.top().second; que.pop();
		if (used[tp.first] || used[tp.second]) continue;
		if (tp.first == 0) {
			cnt++;
			used[tp.second] = true;
		}else if (tp.second == 0) {
			cnt++;
			used[tp.first] = true;
		}
		else {
			used[tp.first] = true;
			used[tp.second] = true;
		}
	}
	cout << cnt << endk;
}