#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//ここから編集する
class UnionFind {
    vector<int> p;//p[i]はiの属する組織
public:
    UnionFind(int n) {
        p = vector<int>(n);
        for (int i = 0; i < n; i++) {
            p[i] = i;
        }
        return;
    }

/* xの属する集合を返す */
    int find(int x) {
        if (p[x] == x) return x;
        return p[x] = find(p[x]);
    }

/* yにxを統合する */
    void unite(int x, int y) {
        p[find(x)] = p[find(y)];
    }

/* xとyが属する集合が同じかを判定する */
    bool same(int x, int y) {
        return find(x) == find(y);
    }

};

class Solve {
public:
    void input() {

    }

    void solve() {
        input();
        int N;
        cin >> N;
        vector<ll> x(N), y(N);
        rep(i, 0, N) {
            cin >> x[i] >> y[i];
        }

        int ans = INF;
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                if (i == j) continue;
                UnionFind uf(N);
                vector<int> gr(N, 1);

                ll p = x[j] - x[i];
                ll q = y[j] - y[i];
                for (int k = 0; k < N; ++k) {
                    for (int l = 0; l < N; ++l) {
                        if (!uf.same(k, l)) {
                            ll dx = x[l] - x[k];
                            ll dy = y[l] - y[k];
                            if (dx == p && dy == q) {
                                gr[uf.find(k)] += gr[uf.find(l)];
                                gr[uf.find(l)] = 0;
                                uf.unite(k, l);
                            }
                        }
                    }
                }

//                int kouho = 0;
//                for (int k = 0; k < N; ++k) {
//                    if (gr[k] > 0) kouho++;
//                }
                set<int> st;
                for (int k = 0; k < N; ++k) {
                    st.insert(uf.find(k));
                }
                int kouho = st.size();
                chmin(ans, kouho);
            }
        }
        if (N == 1) ans = 1;
        cout << ans << endl;

    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 256