
from __future__ import annotations


def     __lowerCAmelCase			(			a__						,    a__  )       ->  float:
				__a										=    sorted(numsa + numsa  )
				__a							,     __a										=    divmod(len(a__  )						,    2  )
				if mod == 1:
								return all_numbers[div]
				else:
								return (all_numbers[div] + all_numbers[div - 1]) / 2


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					A     :	Optional[int]    = [float(x) for x in input('Enter the elements of first array: ').split()]
					A     :	Any    = [float(x) for x in input('Enter the elements of second array: ').split()]
					print(F"The median of two arrays is: {median_of_two_arrays(array_a, array_a)}")

from __future__ import annotations

import typing
from collections import Counter


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


def     __lowerCAmelCase			(			a__ = 1000  )       ->  int:
				__a										=    pythagorean_triple(a__  )
				return triplets.most_common(1  )[0][0]


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