





"""simple docstring"""






def     __A      (			a_						:int = 10)		->		List[Any]:






				if not isinstance(__UpperCamelCase   ,       __UpperCamelCase) or n < 0:
								raise ValueError('''Invalid input''')
				__a :						Dict			       =  10**n
				__a :						List[Any]			       =  2_84_33 * (pow(2   ,       7_83_04_57   ,       __UpperCamelCase)) + 1
				return str(number % modulus)


if __name__ == "__main__":
		from doctest import testmod

		testmod()
		print(F'{solution(10) = }')






"""simple docstring"""






from __future__ import annotations

import typing
from collections import Counter

def     __A      (			a_						:int)		->		typing.Counter[int]:
				__a :						typing.Counter[int]			       =  Counter()
				for base in range(1   ,       max_perimeter + 1):
								for perpendicular in range(a_   ,       max_perimeter + 1):
												__a :						Any			       =  (base * base + perpendicular * perpendicular) ** 0.5
												if hypotenuse == int(a_):
																__a :						List[Any]			       =  int(base + perpendicular + hypotenuse)
																if perimeter > max_perimeter:
																				continue
																triplets[perimeter] += 1
				return triplets

def     __A      (			a_						:int = 10_00)		->		int:
				__a :						Dict			       =  pythagorean_triple(a_)
				return triplets.most_common(1)[0][0]


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