//C

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#include <queue>
#include <stack>
#include <map> 
#include <set>
#include <string>
#include <functional>
#include <list>
#include <random>
#include <time.h>
#include <iomanip>
#include <assert.h>
#include <numeric>
#define int long long
//#define ll long long
#define double long double
#define mod 1000000007
#define MAXN (int)1e+5 * 2+1
#define LL_MAX 9223372036854775807	//ない環境用
#define LL_HALFMAX 9223372036854775807 / 2	//ない環境用
#define MIN -(9223372036854775807 / 2)
#define INF 9223372036854775807 / 2
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define mp make_pair


using namespace std;

std::mt19937 mt((int)time(0));

int dx[4] = { 0, 1, 0, -1 }; // x軸方向への変位
int dy[4] = { 1, 0, -1, 0 }; // y軸方向への変位

using Weight = int;
using Flow = int;
struct Edge {
	int src, dst;
	Weight weight;
	Flow cap;
	Edge() : src(0), dst(0), weight(0) {}
	Edge(int s, int d, Weight w) : src(s), dst(d), weight(w) {}
};
using Edges = std::vector<Edge>;
using Graph = std::vector<Edges>;
using Array = std::vector<Weight>;
using Matrix = std::vector<Array>;

void add_edge(Graph &g, int a, int b, Weight w = 1) {
	g[a].emplace_back(a, b, w);
	g[b].emplace_back(b, a, w);
}
void add_arc(Graph &g, int a, int b, Weight w = 1) { g[a].emplace_back(a, b, w); }

struct uf_tree {
	std::vector<int> parent;
	int __size;
	uf_tree(int size_) : parent(size_, -1), __size(size_) {}
	void unite(int x, int y) {
		if ((x = find(x)) != (y = find(y))) {
			if (parent[y] < parent[x]) std::swap(x, y);
			parent[x] += parent[y];
			parent[y] = x;
			__size--;
		}
	}
	bool is_same(int x, int y) { return find(x) == find(y); }
	int find(int x) { return parent[x] < 0 ? x : parent[x] = find(parent[x]); }
	int size(int x) { return -parent[find(x)]; }
	int size() { return __size; }
};



//!!!問題をちゃんと読む!!!
//!!!問題をちゃんと読め!!!
//!!!問題は読みましたか？!!!

class Node {

};



signed main() {
	int N;
	cin >> N;
	vector<pair<int, int>> pos;
	rep(i, N) {
		int x, y;
		cin >> x >> y;
		pos.push_back(make_pair(x, y));
	}
	sort(pos.begin(), pos.end());
	map<pair<int,int>, int> ma;
	//i -> j にいくときの移動コスト
	rep(i, N) {
		rep(j, N) {
			if (i == j) continue;
			auto diff = make_pair(pos[j].first - pos[i].first, pos[j].second - pos[i].second);
			ma[diff]++;
		}
	}

	int ans = LL_HALFMAX;

	if (N == 1) {
		cout << 1 << "\n";
		return 0;
	}

	for (auto p : ma) {
		int cost = 0;
		//bfs
		bool visited[500] = { 0 };
		auto diff = p.first;
		auto next = make_pair(LL_HALFMAX, LL_HALFMAX);
		rep(i, N) {
			if (visited[i]) continue;
			cost++;
			auto now = pos[i];
			visited[i] = true;
			next = make_pair(pos[i].first + diff.first, pos[i].second + diff.second);
			rep(j, N) {
				if (pos[j].first == next.first && pos[j].second == next.second) {
					now = next;
					next = make_pair(now.first + diff.first, now.second + diff.second);
					visited[j] = true;
				}
			}
		}
		ans = min(ans, cost);
	}
	cout << ans << "\n";
	return 0;
}

Measured memory_bytes: 384