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

const int MAXN = 2e5 + 5;

int N;
int x[MAXN], y[MAXN];

mt19937 rd;

signed main() {
    // freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(false);
    rd.seed(19260817);
    while (cin >> N) {
        for (int i = 1; i <= N; i++)
            cin >> x[i] >> y[i];
        bool flag = false;
        int M;
        for (int o = 1; o <= 50; o++) {
            int id1 = rd() * rd() % N + 1;
            int id2 = rd() * rd() % N + 1;
            int x1 = x[id1], y1 = y[id1], x2 = x[id2], y2 = y[id2];
            if (id1 == id2) continue;
            M = 0;
            for (int i = 1; i <= N; i++) {
                int x3 = x[i], y3 = y[i];
                if ((y1 - y2) * (x3 - x2) == (y3 - y1) * (x1 - x2)) ++M;
            }
            if (M + M / 2 > N) {
                flag = true;
                break;
            }
        }
        cout << (flag ? M - 2 * (N - M) : N % 3) << endl;
    }

    return 0;
}