
'''simple docstring'''
def  __SCREAMING_SNAKE_CASE				(  _SCREAMING_SNAKE_CASE				):
       _snake_case       =  1
       _snake_case       =  2
       while i * i <= n:
              _snake_case       =  0
              while n % i == 0:
                     n //= i
                     multiplicity += 1
              n_divisors *= multiplicity + 1
              i += 1
       if n > 1:
              n_divisors *= 2
       return n_divisors






def  __SCREAMING_SNAKE_CASE				(  ):
       _snake_case       =  1
       _snake_case       =  1

       while True:
              i += 1
              t_num += i

              if count_divisors(_SCREAMING_SNAKE_CASE				) > 500:
                     break

       return t_num


if __name__ == "__main__":
    print(solution())

'''simple docstring'''
from __future__ import annotations

import typing
from collections import Counter






def  __SCREAMING_SNAKE_CASE				(  _SCREAMING_SNAKE_CASE				):
							_snake_case       =  Counter()
							for base in range(1							, max_perimeter + 1				):
														for perpendicular in range(_SCREAMING_SNAKE_CASE							, max_perimeter + 1				):
																					_snake_case       =  (base * base + perpendicular * perpendicular) ** 0.5
																					if hypotenuse == int(_SCREAMING_SNAKE_CASE				):
																												_snake_case       =  int(base + perpendicular + hypotenuse				)
																												if perimeter > max_perimeter:
																																			continue
																												triplets[perimeter] += 1
							return triplets






def  __SCREAMING_SNAKE_CASE				(  _SCREAMING_SNAKE_CASE = 1000				):
							_snake_case       =  pythagorean_triple(_SCREAMING_SNAKE_CASE				)
							return triplets.most_common(1				)[0][0]


if __name__ == "__main__":
				print(f'''Perimeter {solution()} has maximum solutions''')