class Solution(object):

	def numberOfBoomerangs(self, points):
		"""
		:type points: List[List[int]]
		:rtype: int
		"""
		n = len(points)
		dem = 0

		for i in range(n):
			for j in range(i+1, n, 1):
				for k in range(j+1, n, 1):
					if (dictt( points[i], points[j]) == dictt( points[i], points[k])):
						dem += 2
					if (dictt( points[j], points[i]) == dictt( points[j], points[k])):
						dem += 2
					if (dictt( points[k], points[i]) == dictt( points[k], points[j])):
						dem += 2
		return dem

def dictt(p1, p2):
	import math
	return float(math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2))