class Solution:
def numberOfBoomerangs(self, points: List[List[int]]) -> int:
from collections import Counter
if len(points)==1:
return 0
num_boomerang=0
for i in range(len(points)):
list_distance=[]
for j in range(len(points)):
if j==i:
continue
else:
list_distance.append(pow(points[i][0]-points[j][0],2)+pow(points[i][1]-points[j][1],2))
cnt=Counter(list_distance)
for k in cnt:
if cnt[k]>1:
num_boomerang+=cnt[k]*(cnt[k]-1)
return int(num_boomerang)