n=int(input())
xy=[list(map(int,input().split())) for _ in range(n)]
d=[]
if n==1:
    print(1)
else:
    for i in range(n):
        for j in range(n):
            if i!=j:
                d.append([xy[i][0]-xy[j][0],xy[i][1]-xy[j][1]])
    d.sort()
    res = 1
    tres = 1
    for i in range(len(d)-1):
        if d[i] == d[i+1]:
            tres += 1
        else:
            tres = 1
        res = max(res,tres)
    print(n-res) n=int(input()) n int(input()) int input() input list(map(int,input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split xy=[list(map(int,input().split())) for _ in range(n)] xy [list(map(int,input().split())) for _ in range(n)] d=[] d [] if n==1:
    print(1)
else:
    for i in range(n):
        for j in range(n):
            if i!=j:
                d.append([xy[i][0]-xy[j][0],xy[i][1]-xy[j][1]])
    d.sort()
    res = 1
    tres = 1
    for i in range(len(d)-1):
        if d[i] == d[i+1]:
            tres += 1
        else:
            tres = 1
        res = max(res,tres)
    print(n-res) n==1 n 1 print(1) print 1 for i in range(n):
        for j in range(n):
            if i!=j:
                d.append([xy[i][0]-xy[j][0],xy[i][1]-xy[j][1]])
     i range(n) range n for j in range(n):
            if i!=j:
                d.append([xy[i][0]-xy[j][0],xy[i][1]-xy[j][1]])
     j range(n) range n if i!=j:
                d.append([xy[i][0]-xy[j][0],xy[i][1]-xy[j][1]])
     i!=j i j d.append([xy[i][0]-xy[j][0],xy[i][1]-xy[j][1]]) d.append d append [xy[i][0]-xy[j][0],xy[i][1]-xy[j][1]] xy[i][0]-xy[j][0] xy[i][0] [i] xy i 0 xy[j][0] [j] xy j 0 xy[i][1]-xy[j][1] xy[i][1] [i] xy i 1 xy[j][1] [j] xy j 1 d.sort() d.sort d sort res = 1 res 1 tres = 1 tres 1 for i in range(len(d)-1):
        if d[i] == d[i+1]:
            tres += 1
        else:
            tres = 1
        res = max(res,tres)
     i range(len(d)-1) range len(d)-1 len(d) len d 1 if d[i] == d[i+1]:
            tres += 1
        else:
            tres = 1
         d[i] == d[i+1] d[i] d i d[i+1] d i+1 i 1 tres += 1 tres 1 tres = 1 tres 1 res = max(res,tres) res max(res,tres) max res tres print(n-res) print n-res n res n=int(input()) int(input()) n res = 1 1 res tres = 1 1 tres xy=[list(map(int,input().split())) for _ in range(n)] [list(map(int,input().split())) for _ in range(n)] xy res = max(res,tres) max(res,tres) res tres = 1 1 tres tres += 1 1 tres d=[] [] d
n=int(input())
xy=[list(map(int,input().split())) for _ in range(n)]
d=[]
if n==1:
    print(1)
else:
    for i in range(n):
        for j in range(n):
            if i!=j:
                d.append([xy[i][0]-xy[j][0],xy[i][1]-xy[j][1]])
    d.sort()
    res = 1
    tres = 1
    for i in range(len(d)-1):
        if d[i] == d[i+1]:
            tres += 1
        else:
            tres = 1
        res = max(res,tres)
    print(n-res)