


'''simple docstring'''
def    a__			(   lowerCAmelCase__    ,   lowerCAmelCase__		)       ->      Optional[Any]:
    return abs(snake_case__		) if a == 0 else greatest_common_divisor(b % a    ,   snake_case__		)





def    a__			(   lowerCAmelCase__    ,   lowerCAmelCase__		)       ->      Optional[int]:



    while y:  # --> when y=0 then loop will terminate and return x as final GCD.
        UpperCAmelCase__     :						List[Any]						=							y, x % y
    return abs(snake_case__		)





def    a__			(   )       ->      Union[str, Any]:



    try:
        UpperCAmelCase__     :						int						=							input('''Enter two integers separated by comma (,): '''		).split(''','''		)
        UpperCAmelCase__     :						List[str]						=							int(nums[0]		)
        UpperCAmelCase__     :						str						=							int(nums[1]		)
        print(
            F"""greatest_common_divisor({num_a}, {num_a}) = """
            F"""{greatest_common_divisor(snake_case__    ,   snake_case__		)}"""		)
        print(F"""By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(snake_case__    ,   snake_case__		)}"""		)
    except (IndexError, UnboundLocalError, ValueError):
        print('''Wrong input'''		)


if __name__ == "__main__":
  main()


'''simple docstring'''




import math
from collections.abc import Callable







def 						lowerCAmelCase_							(  snake_case__						,							snake_case__						,							snake_case__		):




    '''simple docstring'''



    A			:  float   =		xa
    A			:  float   =		xa
    while True:
        if x_n == x_na or function(snake_case__		) == function(snake_case__		):
            raise ZeroDivisionError('''float division by zero, could not find root'''		)
        A			:  float   =		x_na - (
            function(snake_case__		) / ((function(snake_case__		) - function(snake_case__		)) / (x_na - x_n))
        )
        if abs(x_na - x_na		) < 10**-5:
            return x_na
        A			:  Any   =		x_na
        A			:  Any   =		x_na







def 						lowerCAmelCase_							(  snake_case__		):




    '''simple docstring'''



    return math.pow(snake_case__						,							3		) - (2 * x) - 5


if __name__ == "__main__":
      print(intersection(f, 3, 3.5))




