





def 		lowerCAmelCase_    (  __UpperCAmelCase:			int		,   __UpperCAmelCase:			int      )      ->	int:
    return x if y == 0 else greatest_common_divisor(__UpperCAmelCase		,   x % y      )




def 		lowerCAmelCase_    (  __UpperCAmelCase:			int		,   __UpperCAmelCase:			int      )      ->	int:
    return (x * y) // greatest_common_divisor(__UpperCAmelCase		,   __UpperCAmelCase      )




def 		lowerCAmelCase_    (  __UpperCAmelCase:			int = 20      )      ->	int:
    UpperCamelCase__							:				List[Any]          =      1
    for i in range(1		,   n + 1      ):
        UpperCamelCase__							:				Optional[Any]          =      lcm(__UpperCAmelCase		,   __UpperCAmelCase      )
    return g


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








from __future__ import annotations




def 		lowerCAmelCase_    (  __UpperCAmelCase:			list[int]		,   __UpperCAmelCase:			int      )      ->	list[int]:
    UpperCamelCase__							:				Optional[int]          =      0
    UpperCamelCase__							:				Tuple          =      len(__UpperCAmelCase      ) - 1

    while i < j:
        if nums[i] + nums[j] == target:
            return [i, j]
        elif nums[i] + nums[j] < target:
            UpperCamelCase__							:				Tuple          =      i + 1
        else:
            UpperCamelCase__							:				str          =      j - 1

    return []


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  print(F'''{two_pointer([2, 7, 11, 15], 9) = }''')

