#include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<P> vp;
typedef vector<PL> vpl;
typedef vector<vector<P>> vvp;
typedef vector<vector<PL>> vvpl;
const int INF = 1001001001;
const ll LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for(ll i = (a); i < b; i++)
#define RFOR(i, a, b) for(ll i = (a); i > b; i--)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define RREP(i, n) for(ll i = n-1; i > -1; i--)
#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back

template <typename T>
T gcd(T a, T b) {
    return (a == 0) ? b : gcd(b%a, a);
}
template <typename T>
T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}

bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};
bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};
bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};
bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};
template <typename T>
vector<T> uniquen(vector<T> vec){
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    return vec;
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll N; cin >> N;
    vpl xy(N);
    REP(i, N){
        ll x,y; cin >> x >> y; xy[i] = {x,y};
    }
    
    vpl mv;
    REP(i, N) FOR(j,i+1, N){
        mv.pb({xy[i].ff-xy[j].ff, xy[i].ss-xy[j].ss});
    }
    
    ll ans = N;
    
    REP(i, mv.size()){
        
        vb reached(N, false);
        PL move = mv[i];
        
        ll cand = 0;
        while(true){
            ll ini = -1;
            REP(i, N) if(!reached[i]) ini = i;
            if(ini == -1) break;
            
            PL now = xy[ini]; reached[ini] = true; cand++;
            
            stack<PL> st; st.push(now);
            while(!st.empty()){
                PL now = st.top(); st.pop();
                REP(i, N){
                    if(!reached[i]){
                        ll xd = xy[i].ff-now.ff;
                        ll yd = xy[i].ss-now.ss;
                        if(xd == move.ff && yd == move.ss){
                            reached[i] = true;
                            st.push(xy[i]);
                        }
                        else if (xd == -move.ff && yd == -move.ss)
                        {
                            reached[i] = true;
                            st.push(xy[i]);
                        }
                    }
                }
            }
            
            
        }
        ans = min(ans, cand);
    }
    cout << ans << endstr;
    return 0;
}


Measured memory_bytes: 384