
from doctest import testmod
from math import sqrt
def lowerCamelCase_       (			A			:      int						):




      """simple docstring"""
      lowerCAmelCase_						=      []
      if num < 1:
            return facs
      facs.append(1						)
      if num == 1:
            return facs
      facs.append(A						)
      for i in range(2		,					int(sqrt(A						)						) + 1						):
            if num % i == 0:  # If i is a factor of num
                  facs.append(A						)
                  lowerCAmelCase_						=      num // i  # num//i is the other factor of num
                  if d != i:  # If d and i are distinct
                        facs.append(A						)  # we have found another factor
      facs.sort()
      return facs


if __name__ == "__main__":
 testmod(name="factors_of_a_number", verbose=True)





_snake_case		  =   {
    "+": lambda x, y: x + y,
    "-": lambda x, y: x - y,
    "*": lambda x, y: x * y,
    "/": lambda x, y: x / y,
}
def lowerCamelCase_       (			A			:      List[Any]						):




      """simple docstring"""
      return c.isdigit()
def lowerCamelCase_       (			A			:      List[Any]						):




      """simple docstring"""
      lowerCAmelCase_						=      []

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

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

      return stack.pop()


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

 _snake_case		  =   "/ * 10 2 + 4 1 "
 print(evaluate(test_expression))



