import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;

void main() {
  int n;
  readf (" %d", &n);
  auto x = new int[n];
  auto y = new int[n];
  foreach (t; 0 .. n) {
    readf (" %d %d", &x[t], &y[t]);
  }
  int res = n;
  void test (int dx, int dy) {
    int r;
    foreach (i; 0 .. n) {
      bool find = false;
      foreach (j; 0 .. n) {
        if (x[j] == x[i] - dx && y[j] == y[i] - dy) {
          find = true;
          break;
        }
      }
      if (!find) ++r;
    }
    res = min (res, r);
  }
  foreach (j; 0 .. n) {
    foreach (i; 0 .. n) if (i != j) {
      test (x[j] - x[i], y[j] - y[i]);
    }
  }
  writeln (res);
}
