Buggy python submission (verdict: Runtime Error):
from collections import defaultdict as de
s=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))for i in range(n)])
for i in range(n):
    for j in range(i):
        s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
print(n-max(s.values()))


Fixed submission:
from collections import defaultdict as de
s=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))for i in range(n)])
for i in range(n):
    for j in range(i):
        s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
print(n-max(s.values(),default=0))

Buggy python submission (verdict: Runtime Error):
from collections import defaultdict as de
s=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))for i in range(n)])
for i in range(n):
    for j in range(i-1):
        s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
print(n-max(s.values()))


Fixed submission:
from collections import defaultdict as de
s=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))for i in range(n)])
for i in range(n):
    for j in range(i):
        s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
print(n-max(s.values(),default=0))

Buggy python submission (verdict: Runtime Error):
from collections import defaultdict as de
s=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))+[0]for i in range(n)])
for i in range(n):
    for j in range(n):
        if i!=j:
            s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
print(n-max(s.values()))


Fixed submission:
from collections import defaultdict as de
s=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))for i in range(n)])
for i in range(n):
    for j in range(i):
        s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
print(n-max(s.values(),default=0))

Buggy python submission (verdict: Runtime Error):
from collections import defaultdict as de
s=de(int)
u=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))for i in range(n)])
for i in range(n):
    u.append(a[i])
    for j in range(n):
        if i!=j:
            s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
p,q=max([(v,k) for k,v in s.items()])[1]
i=0
p=n-1
g=0
while i!=n:
    if u[a[n-1]]>0:
        u[a[n-1]]-=1
    s,t=a[n-1][0]-p,a[n-1][1]-q
    i+=1
    while u[s,t]>0:
        u[s,t]-=1
        s-=p
        t-=q
        i+=1
    else:
        g+=1
print(g)

Fixed submission:
from collections import defaultdict as de
s=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))for i in range(n)])
for i in range(n):
    for j in range(i):
        s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
print(n-max(s.values(),default=0))

Buggy python submission (verdict: Runtime Error):
from collections import defaultdict as de
s=de(int)
n=int(input())
a=[list(map(int,input().split()))for i in range(n)]
for i in range(n):
    for j in range(n):
        if i!=j:
            s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
p,q=max([(v,k) for k,v in s.items()])[1]
f=0
while len(a)!=0:
    b,c=a[0]
    f+=1
    g=[]
    for i in range(1,len(a)):
        d,e=a[i]
        if d-b==0:
            if q!=0:
                g.append([d,e])
        elif q==0:
            if d-b!=0:
                g.append([d,e])
        elif (e-c)/(d-b)!=q/p:
            g.append([d,e])
    else:
        a=g[:][1:]
print(f)

Fixed submission:
from collections import defaultdict as de
s=de(int)
n=int(input())
a=sorted([list(map(int,input().split()))for i in range(n)])
for i in range(n):
    for j in range(i):
        s[(a[i][0]-a[j][0],a[i][1]-a[j][1])]+=1
print(n-max(s.values(),default=0))