#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

struct Point{
  long long x;
  long long y;
  Point(long long x, long long y): x(x), y(y) {}
  Point(): x(0), y(0) {}
};

Point operator-(const Point& A, const Point& B) {
  return Point(A.x - B.x, A.y - B.y);
}

long long cross(const Point& A, const Point& B) {
  return A.x * B.y - A.y * B.x;
}

bool same_line(const Point& A, const Point& B, const Point& C) {
  return cross(C - A, C - B) == 0;
}

mt19937_64 rnd(179);

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n;
  while (cin >> n) {
    vector<Point> A(n);
    for (int i = 0; i < n; ++i)
      cin >> A[i].x >> A[i].y;
    int max_line = 1;
    for (int _ = 0; _ < 60; ++_) {
      int x = rnd() % n;
      int y = x;
      while (y == x)
        y = rnd() % n;
      int cnt = 0;
      for (auto P : A)
        cnt += same_line(A[x], A[y], P);
      max_line = max(max_line, cnt);
    }
    if (max_line >= 2 * (n - max_line)) {
      cout << n - 3 * (n - max_line) << '\n';
    } else {
      cout << n % 3 << '\n';
    }
  }
  return 0;
}