
"""simple docstring"""
def     __lowerCamelCase  (		):


	"""simple docstring"""






	for a in range(300      ):
		for b in range(a + 1				,     400      ):
			for c in range(b + 1				,     500      ):
				if (a + b + c) == 1000 and (a**2) + (b**2) == (c**2):
					return a * b * c

	return -1




def     __lowerCamelCase  (		):


	"""simple docstring"""






	for a in range(300      ):
		for b in range(400      ):
			_UpperCAmelCase =						1000 - a - b
			if a < b < c and (a**2) + (b**2) == (c**2):
				return a * b * c

	return -1




def     __lowerCamelCase  (		):


	"""simple docstring"""






	import timeit

	print(
	    timeit.timeit("solution()"				,     setup="from __main__ import solution"				,     number=1000      )      )
	print(
	    timeit.timeit(
	        "solution_fast()"				,     setup="from __main__ import solution_fast"				,     number=1000      )      )


if __name__ == "__main__":
			print(f'''{solution() = }''')






"""simple docstring"""
import heapq




def     __lowerCamelCase  (		UpperCamelCase__				,     UpperCamelCase__				,     UpperCamelCase__      ):


	"""simple docstring"""






	_UpperCAmelCase =						[(0, start)]  # cost from start node,end node
	_UpperCAmelCase =						set()
	while heap:
		((_UpperCAmelCase) ,      (_UpperCAmelCase)) =						heapq.heappop(UpperCamelCase__      )
		if u in visited:
			continue
		visited.add(UpperCamelCase__      )
		if u == end:
			return cost
		for v, c in graph[u]:
			if v in visited:
				continue
			_UpperCAmelCase =						cost + c
			heapq.heappush(UpperCamelCase__				,     (next_item, v)      )
	return -1


__magic_name__		       =				{
    '''A''': [['''B''', 2], ['''C''', 5]],
    '''B''': [['''A''', 2], ['''D''', 3], ['''E''', 1], ['''F''', 1]],
    '''C''': [['''A''', 5], ['''F''', 3]],
    '''D''': [['''B''', 3]],
    '''E''': [['''B''', 4], ['''F''', 3]],
    '''F''': [['''C''', 3], ['''E''', 3]],
}
__magic_name__		       =				{
    '''B''': [['''C''', 1]],
    '''C''': [['''D''', 1]],
    '''D''': [['''F''', 1]],
    '''E''': [['''B''', 1], ['''F''', 3]],
    '''F''': [],
}
__magic_name__		       =				{
    '''B''': [['''C''', 1]],
    '''C''': [['''D''', 1]],
    '''D''': [['''F''', 1]],
    '''E''': [['''B''', 1], ['''G''', 2]],
    '''F''': [],
    '''G''': [['''F''', 1]],
}

__magic_name__		       =				dijkstra(G, '''E''', '''C''')
print(short_distance)  # E -- 3 --> F -- 3 --> C == 6

__magic_name__		       =				dijkstra(Ga, '''E''', '''F''')
print(short_distance)  # E -- 3 --> F == 3

__magic_name__		       =				dijkstra(Ga, '''E''', '''F''')
print(short_distance)  # E -- 2 --> G -- 1 --> F == 3

if __name__ == "__main__":
			import doctest

			doctest.testmod()




