#include <bits/stdc++.h>
using namespace std;

using point_t = long long;
constexpr point_t eps = 1e-8;

template<typename T> struct point {
    T x, y;

    point<T> operator-(point a) { return {x - a.x, y - a.y}; }
    T operator^(point a) { return x * a.y - y * a.x; }
    int toleft(point a) { auto t = (*this) ^ a; return (t > eps) - (t < -eps); }
};
using Point = point<point_t>;

#define int long long
signed main() {
    int n; while (cin >> n) {
        vector<Point> p(n);
        for (auto &[x, y] : p) scanf("%lld %lld", &x, &y);

        auto cnt_in_line = [&](int i, int j) {
            Point i_j = p[i] - p[j];
            int res = 0;
            for (int k = 0; k < n; k++) {
                if (i_j.toleft(p[k] - p[j]) == 0) res++;
            }
            return res;
        };

        if (n <= 100) {
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    int cnt = cnt_in_line(i, j);
                    if (cnt * 3 >= 2 * n) {
                        cout << n - (n - cnt) * 3 << endl;
                        goto END;
                    }
                }
                if (i == n - 1) cout << n % 3 << endl;
            }
        } else {
            for (int _ = 0; _ < 1000; _++) {
                int i = rand() % n, j = i;
                while (j == i) j = rand() % n;
                int cnt = cnt_in_line(i, j);
                if (cnt * 3 > n || cnt * 2 >= n) {
                    if (cnt * 3 >= 2 * n) cout << n - (n - cnt) * 2 << endl;
                    else cout << n % 3 << endl;
                    goto END;
                }
                if (_ == 14) cout << n % 3 << endl;
            }
        }
        END: ;
    }
    return 0;
}