#include // #include using namespace std; // using namespace atcoder; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(int)(n);i>0;i--) #define REP(i,a,b) for(int i=a;i bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; #define Sp(p) cout<> n; vector yx(n); rep (i, n) cin >> yx[i].first >> yx[i].second; using P = pair; vector

events; rep (i, n) { REP (j, i + 1, n) { ll dist = (yx[i].first - yx[j].first) * (yx[i].first - yx[j].first) + (yx[i].second - yx[j].second) * (yx[i].second - yx[j].second); events.push_back(P(dist, pii(i, j))); } } sort(all(events)); // DEBUG_VEC(events); vi alive(n, 1); int cnt = 0; rep (j, events.size()) { int u = events[j].second.first, v = events[j].second.second; if (v == 0) swap(u, v); if (u != 0) { if (alive[u] and alive[v]) alive[u] = alive[v] = 0; } else { if (alive[v]) cnt++; alive[v] = 0; } } cout << cnt << endl; }