



'''simple docstring'''






A_							: Optional[int]						 =	"""Tobias Carryer"""

from time import time



class 							lowercase       :


 """simple docstring"""


 def __init__(							self  ,a_  ,a_  ,a_  ,a_=int(time()							)							)		->   List[str]:  # noqa: B008
        _UpperCAmelCase  :						Optional[Any]			     = multiplier
        _UpperCAmelCase  :						Dict			     = increment
        _UpperCAmelCase  :						List[Any]			     = modulo
        _UpperCAmelCase  :						Tuple			     = seed







 def _snake_case (							self							)		->   Optional[int]:
        _UpperCAmelCase  :						Tuple			     = (self.multiplier * self.seed + self.increment) % self.modulo
        return self.seed


if __name__ == "__main__":
   # Show the LCG in action.
   A_							: List[str]						 =	LinearCongruentialGenerator(1_6_6_4_5_2_5, 1_0_1_3_9_0_4_2_2_3, 2 << 3_1)
   while True:
      print(lcg.next_number())








'''simple docstring'''






from __future__ import annotations

import typing
from collections import Counter




def     snake_case_					(     lowerCAmelCase_		)->		typing.Counter[int]:





       '''simple docstring'''


       _UpperCAmelCase  :						typing.Counter[int]			     = Counter()
       for base in range(1       ,   max_perimeter + 1		):
              for perpendicular in range(lowerCAmelCase_       ,   max_perimeter + 1		):
                     _UpperCAmelCase  :						List[str]			     = (base * base + perpendicular * perpendicular) ** 0.5
                     if hypotenuse == int(lowerCAmelCase_		):
                            _UpperCAmelCase  :						Optional[Any]			     = int(base + perpendicular + hypotenuse		)
                            if perimeter > max_perimeter:
                                   continue
                            triplets[perimeter] += 1
       return triplets




def     snake_case_					(     lowerCAmelCase_ = 1000		)->		int:





       '''simple docstring'''


       _UpperCAmelCase  :						int			     = pythagorean_triple(lowerCAmelCase_		)
       return triplets.most_common(1		)[0][0]


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



