#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

template <typename T>
long long gcd(T x, T y){
	return y==0 ? x : gcd(y, x%y);
}

//library

class UFTree {
//private:
public:
	vector<int> par;
	vector<int> rank;
	vector<int> num;

//public:
	UFTree(int n)
	{
		par = vector<int>(n);
		rank = vector<int>(n);
		num = vector<int>(n);
		for(int i = 0; i < n; i++){
			par[i] = i;
			rank[i] = 0;
			num[i] = 1;
		}
	}

	int find(int x)
	{
		if(par[x] == x){
			return x;
		}else{
			return par[x] = find(par[x]);
		}
	}

	void unite(int x, int y)
	{
		x = find(x);
		y = find(y);
		if(x == y) return;
		if(rank[x] < rank[y]){
			par[x] = y;
			num[y] += num[x];
		}else{
			par[y] = x;
			num[x] += num[y];
			if(rank[x] == rank[y])	rank[x]++;
		}
	}

	int count(int x)
	{
		return num[find(x)];
	}

	bool same(int x, int y)
	{
		return find(x) == find(y);
	}
};
//library

int main()
{
	ios_init();
	int n;
	while(cin >> n) {
		vector<LL> x(n), y(n);
		REP(i, n) cin >> x[i] >> y[i];
		// REP(i, n) {
		// 	x[i] = abs(x[i]);
		// 	y[i] = abs(y[i]);
		// }
		auto cnt = [&](LL p, LL q) -> int{
			if(p == 0 and q == 0) return n;
			// set<P> set;
			// REP(i, n) {
			// 	set.emplace(x[i], y[i]);
			// }
			UFTree uft(n);
			REP(i, n) {
				REP(j, n) {
					LL dx = x[i] - x[j];
					LL dy = y[i] - y[j];
					if(p == 0) {
						if(dx == 0 and dy == q) {
							// DEBUG(i); DEBUG(j);
							uft.unite(i, j);
						}
					} else if(q == 0) {
						if(dy == 0 and dx == p) {
							// DEBUG(i); DEBUG(j);
							uft.unite(i, j);
						}
					} else {
						if(dx == p and  dy == q) {
							// DEBUG(i); DEBUG(j);
							uft.unite(i, j);
						}
					}
				}
			}
			set<int> s;
			REP(i, n) {
				s.insert(uft.find(i));
			}
			return s.size();
		};
		int ans = n;
		REP(i, n) REP(j, n) {
			LL a = x[i] - x[j];
			LL b = y[i] - y[j];
			
			// if(a != 0 and b != 0) {
			// 	LL g = gcd(abs(a), abs(b));
			// 	a /= g;
			// 	b /= g;
			// }
			chmin(ans, cnt(a, b));
		}
		cout << ans << endl;
	}
	return 0;
}


Measured memory_bytes: 256