N = gets.to_i
pos = []
N.times do
  pos << gets.split.map(&:to_i)
end
diffs = []
cnt = 0
N.times do |i|
  N.times do |j|
    x = pos[i][0]-pos[j][0]
    y = pos[i][1]-pos[j][1]
    diffs << [x,y] if x > 0
  end
end

diffs.sort!
c,mc = 1,1
prev = [0,0]
diffs.each do |a|
  if prev == a
    c += 1
  else
    mc = c if c > mc
    c = 1
  end
  prev = a
end
p N-mc