code: 
  
  
  
  """simple docstring"""
  import unittest
  from timeit import timeit
  
  
  
  
  
  def 				lowerCamelCase_		(UpperCamelCase__	:	int  , UpperCamelCase__	:	int							):
      _UpperCAmelCase							:						Any       							=					first_num if first_num >= second_num else second_num
      _UpperCAmelCase							:						List[Any]       							=					max_num
      while (common_mult % first_num > 0) or (common_mult % second_num > 0):
          common_mult += max_num
      return common_mult
  
  
  
  
  
  def 				lowerCamelCase_		(UpperCamelCase__	:	int  , UpperCamelCase__	:	int							):
      return b if a == 0 else greatest_common_divisor(b % a  , UpperCamelCase__							)
  
  
  
  
  
  def 				lowerCamelCase_		(UpperCamelCase__	:	int  , UpperCamelCase__	:	int							):
      return first_num // greatest_common_divisor(UpperCamelCase__  , UpperCamelCase__							) * second_num
  
  
  
  
  
  def 				lowerCamelCase_		():
      _UpperCAmelCase							:						Optional[Any]       							=					(
          '''from __main__ import least_common_multiple_slow, least_common_multiple_fast'''
      )
      print(
          '''least_common_multiple_slow():'''  , timeit('''least_common_multiple_slow(1000, 999)'''  , setup=UpperCamelCase__							)  , )
      print(
          '''least_common_multiple_fast():'''  , timeit('''least_common_multiple_fast(1000, 999)'''  , setup=UpperCamelCase__							)  , )
  class 							_UpperCAmelCase							(				unittest.TestCase   ):
  
  
  
  
  
       '''simple docstring'''
  
  
  
       a__             =(
           (1_0, 2_0),
           (1_3, 1_5),
           (4, 3_1),
           (1_0, 4_2),
           (4_3, 3_4),
           (5, 1_2),
           (1_2, 2_5),
           (1_0, 2_5),
           (6, 9),
       )
       a__             =(2_0, 1_9_5, 1_2_4, 2_1_0, 1_4_6_2, 6_0, 3_0_0, 5_0, 1_8)
  
  
  
  
  
       def 				__lowerCAmelCase			(      self	)							->      Tuple:
           for i, (first_num, second_num) in enumerate(self.test_inputs	):
               _UpperCAmelCase							:						Optional[int]       							=					least_common_multiple_slow(A ,			A	)
               _UpperCAmelCase							:						List[str]       							=					least_common_multiple_fast(A ,			A	)
               with self.subTest(i=A	):
                   self.assertEqual(A ,			self.expected_results[i]	)
                   self.assertEqual(A ,			self.expected_results[i]	)
  
  
  if __name__ == "__main__":
    benchmark()
    unittest.main()
  
  
  
style_context: 
  
  
  
  """simple docstring"""
  def 				lowerCamelCase_		(UpperCamelCase__	:	List[Any]  , UpperCamelCase__	:	int							):
      sequence.append(UpperCamelCase__							)
  
      _UpperCAmelCase							:						str       							=					0
      while sequence[index] != target:
          index += 1
  
      sequence.pop()
  
      if index == len(UpperCamelCase__							):
          return None
  
      return index
  
  
  if __name__ == "__main__":
    _lowerCAmelCase					:Dict  =      input('Enter numbers separated by comma:\n').strip()
    _lowerCAmelCase					:List[Any]  =      [int(item) for item in user_input.split(',')]
  
    _lowerCAmelCase					:int  =      input('Enter a single number to be found in the list:\n')
    _lowerCAmelCase					:List[Any]  =      int(target_input)
    _lowerCAmelCase					:Optional[int]  =      sentinel_linear_search(sequence, target)
    if result is not None:
      print(f"{target} found at positions: {result}")
    else:
      print('Not found')
  
  
  