


def       lowercase_		(		_A			:    List[str]    ,					_A			:    Union[str, Any]						):

      """simple docstring"""




      return x if y == 0 else greatest_common_divisor(a_    ,					x % y						)

def       lowercase_		(		_A			:    Any    ,					_A			:    Optional[int]						):

      """simple docstring"""




      return (x * y) // greatest_common_divisor(a_    ,					a_						)

def       lowercase_		(		_A			:    List[str] = 20						):

      """simple docstring"""




      lowerCamelCase__		:				int    =  1
      for i in range(1    ,					n + 1						):
            lowerCamelCase__		:				str    =  lcm(a_    ,					a_						)
      return g


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










from __future__ import annotations





def 						__UpperCAmelCase			(     a_							,     a_							,     a_							,     a_):  # noqa: E741
							while r - l > 1:
														snake_case_				=							(l + r) // 2
														if v[m] >= key:
																					snake_case_				=							m
														else:
																					snake_case_				=							m  # noqa: E741
							return r





def 						__UpperCAmelCase			(     a_):
							if len(a_) == 0:
														return 0

							snake_case_				=							[0] * len(a_)
							snake_case_				=							1

							snake_case_				=							v[0]

							for i in range(1							,     len(a_)):
														if v[i] < tail[0]:
																					snake_case_				=							v[i]
														elif v[i] > tail[length - 1]:
																					snake_case_				=							v[i]
																					length += 1
														else:
																					snake_case_				=							v[i]

							return length


if __name__ == "__main__":
	import doctest

	doctest.testmod()





