





def     _UpperCamelCase     (a__   :int       ):






							"""simple docstring"""





							UpperCamelCase__				     =			0
							while num > 0:
														digit_sum += num % 10
														num //= 10
							return digit_sum





def     _UpperCamelCase     (a__   :int = 100       ):






							"""simple docstring"""





							UpperCamelCase__				     =			1
							UpperCamelCase__				     =			2

							for i in range(2   ,			max_n + 1       ):
														UpperCamelCase__				     =			pre_numerator
														UpperCamelCase__				     =			2 * i // 3 if i % 3 == 0 else 1
														UpperCamelCase__				     =			cur_numerator
														UpperCamelCase__				     =			e_cont * pre_numerator + temp

							return sum_digits(a__       )


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











from typing import Any





def     _UpperCamelCase     (a__   :list       ):






							"""simple docstring"""





							if not input_list:
														return []
							UpperCamelCase__				     =			[input_list.count(a__       ) for value in input_list]
							UpperCamelCase__				     =			max(a__       )  # Gets the maximum count in the input list.
							# Gets values of modes
							return sorted({input_list[i] for i, value in enumerate(a__       ) if value == y}       )


if __name__ == "__main__":
					import doctest

					doctest.testmod()




