#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,long long>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
P f(long long x, long long y) {
	long long d = gcd(x, y);
	if (0 == x)return { 0,1 };
	x /= d;
	y /= d;
	if (x < 0)return { -x,-y };
	return { x,y };
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>x(n), y(n);
	rep(i, n)cin >> x[i] >> y[i];
	vector<bool>chk(n);
	rep(i, n) {
		map<P, set<int>>s0, s1;
		rep(j, n) {
			if (i == j)continue;
			long long dx = x[j] - x[i];
			long long dy = y[j] - y[i];
			auto p = f(dx, dy);
			if ((dy > 0) || ((0 == dy) && (dx < 0))) {
				s0[p].insert(j);
			}
			else {
				s1[p].insert(j);
			}
		}
		for (auto[k, st] : s0) {
			if (!s1.count(k))continue;
			for (auto e : st)chk[e] = true;
			for (auto e : s1[k])chk[e] = true;
		}
	}
	int ans = 0;
	rep(i, n)if (chk[i])ans++;
	cout << ans << endl;
	return 0;
}