#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //using ll = long long; using ll = int; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return a + b; } val e() { return 0; } val mp(func f, val a) { if (f == -1) return a; return f; } func comp(func f, func g) { if (f == -1) return g; return f; } func id() { return -1; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n; cin >> n; auto [x, y] = read_tuple(n); map, unordered_set> mp; REP(i, n) { REP(j, n) { if (i == j) continue; ll dx = y[i] - y[j]; ll dy = -(x[i] - x[j]); ll dc = -(dx * x[i] + dy * y[i]); ll g = gcd(gcd(dx, dy), dc); if (dx < 0 || (dx == 0 && dy < 0)) g *= -1; if (g == 0) continue; dx /= g; dy /= g; dc /= g; mp[make_tuple(dx, dy, dc)].insert(i); } } vector unhappy(n); for (auto& [k, vc] : mp) { if (vc.size() < 3) continue; if (vc.size() > 3) { for (auto& v : vc) { unhappy[v] = true; } continue; } VL vv(all(vc)); REP(i, 3) { ll inner = (x[vv[(i + 2) % 3]] - x[vv[i]]) * (x[vv[(i + 1) % 3]] - x[vv[i]]) + (y[vv[(i + 2) % 3]] - y[vv[i]]) * (y[vv[(i + 1) % 3]] - y[vv[i]]); if (inner > 0) { unhappy[vv[i]] = true; } } } ll ans = 0; REP(i, n) { ans += unhappy[i]; } cout << ans << endl; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }