#include<bits/stdc++.h>

typedef long long ll;
using namespace std;
const int N = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;

char nc() {
    static char buf[1000000], *p = buf, *q = buf;
    return p == q && (q = (p = buf) + fread(buf, 1, 1000000, stdin), p == q) ? EOF : *p++;
}

inline ll read() {
    ll x = 0;
    int f = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-')f = -1;
        ch = getchar();
    }
    while (isdigit(ch)) {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}

int n;
struct Point {
    ll x, y;
} s[N];


int vis[N];

int calc(int j) {
    int now = 0;
    map<pair<ll, ll>, int> mp;
    for (int i = 1; i <= n; i++) {
        if (i == j) continue;
        int X = s[i].x - s[j].x, Y = s[i].y - s[j].y;
        if (X < 0) {
            X = -X;
            Y = -Y;
        } else if (X == 0) {
            if (Y < 0) Y = -Y;
        }
        mp[make_pair(X, Y)]++;
    }
//    printf("j=%d:\n", j);
    for (auto to: mp) {
        now = max(now, to.second + 1);
//        printf(" NOW = %d\n", to.second + 1);
    }
    return now;
}

void solve() {
    srand(time(0));
    for (int i = 1; i <= n; i++) vis[i] = 0;
    for (int i = 1; i <= n; i++) s[i].x = read(), s[i].y = read();
    int T = min(n, 50);
    int now = 0;
    while (T--) {
        int x = rand() % n + 1;
        while (vis[x]) x = rand() % n + 1;
        vis[x] = 1;
        now = max(now, calc(x));
    }
    int last = n - now;
    if (now > last * 2) {
        printf("%d\n", now - last * 2);
    } else {
        printf("%d\n", n % 3);
    }
}

signed main() {
//    int t = read();
//    while (t--)
    while (scanf("%d", &n) != EOF)
        solve();
    return 0;
}
/*
1
1
1
1
 */