def solution_2():
solutions = pythagorean(1000)
num = max(len(k) for k in solutions.values())
for m, n in sorted(solutions.items()):
if len(n) == num:
print m
break
def main():
m = 24
perimeter_limit = int(ceil(3*m+(5*m**2)**0.5))
pytha = pythagorean(perimeter_limit)
count = arr_result(m,pytha)
print count
