

def 						UpperCamelCase (lowercase_:			int = 1000000 )					->				int:
	A__							:   List[str]					       =		limit + 1
	A__							:   int					       =		[0] * limit
	for first_term in range(1   ,				lowercase_ ):
		for n in range(lowercase_   ,				lowercase_   ,				lowercase_ ):
			A__							:   List[Any]					       =		first_term + n / first_term
			if common_difference % 4:  # d must be divisble by 4
				continue
			else:
				common_difference /= 4
				if (
				    first_term > common_difference
				    and first_term < 4 * common_difference
				):  # since x,y,z are positive integers
					frequency[n] += 1  # so z>0 and a>d ,also 4d<a

	A__							:   Optional[int]					       =		sum(1 for x in frequency[1:limit] if x == 10 )

	return count


if __name__ == "__main__":
	print(f'''{solution() = }''')






from typing import Any

def 						UpperCamelCase (lowercase_:			list )					->				list[Any]:
	if not input_list:
		return []
	A__							:   Any					       =		[input_list.count(lowercase_ ) for value in input_list]
	A__							:   List[Any]					       =		max(lowercase_ )  # Gets the maximum count in the input list.
	# Gets values of modes
	return sorted({input_list[i] for i, value in enumerate(lowercase_ ) if value == y} )


if __name__ == "__main__":
	import doctest

	doctest.testmod()



