

def    snake_case_(_UpperCamelCase  )							->			Optional[Any]:



  """simple docstring"""






  _snake_case		=							len(_UpperCamelCase  )
  for i in range(length - 1  ):
    _snake_case		=							False
    for j in range(length - 1 - i  ):
      if collection[j] > collection[j + 1]:
        _snake_case		=							True
        _snake_case,  _snake_case		=							collection[j + 1], collection[j]
    if not swapped:
      break  # Stop iteration if the collection is sorted.
  return collection


if __name__ == "__main__":
 import doctest
 import time

 doctest.testmod()

 __A    	=			input('''Enter numbers separated by a comma:''').strip()
 __A    	=			[int(item) for item in user_input.split(''',''')]
 __A    	=			time.process_time()
 print(*bubble_sort(unsorted), sep=''',''')
 print(f'''Processing time: {(time.process_time() - start)%1e9 + 7}''')




__A    	=			{
    '''+''': lambda x, y: x + y,
    '''-''': lambda x, y: x - y,
    '''*''': lambda x, y: x * y,
    '''/''': lambda x, y: x / y,
}



def    snake_case_(_UpperCamelCase  )							->			str:



  """simple docstring"""






  return c.isdigit()



def    snake_case_(_UpperCamelCase  )							->			str:



  """simple docstring"""






  _snake_case		=							[]

  # iterate over the string in reverse order
  for c in expression.split()[::-1]:
    # push operand to stack
    if is_operand(_UpperCamelCase  ):
      stack.append(int(_UpperCamelCase  )  )

    else:
      # pop values from stack can calculate the result
      # push the result onto the stack again
      _snake_case		=							stack.pop()
      _snake_case		=							stack.pop()
      stack.append(calc[c](_UpperCamelCase				, _UpperCamelCase  )  )

  return stack.pop()


# Driver code
if __name__ == "__main__":
 __A    	=			'''+ 9 * 2 6'''
 print(evaluate(test_expression))

 __A    	=			'''/ * 10 2 + 4 1 '''
 print(evaluate(test_expression))

