





'''simple docstring'''
def 				lowercase__   (   __lowercase						:  int				,  __lowercase						:  int     ) ->      List[str]:



       """simple docstring"""






       return abs(SCREAMING_SNAKE_CASE__     ) if a == 0 else greatest_common_divisor(b % a				,  SCREAMING_SNAKE_CASE__     )
def 				lowercase__   (   __lowercase						:  int				,  __lowercase						:  int     ) ->      Optional[Any]:



       """simple docstring"""






       while y:  # --> when y=0 then loop will terminate and return x as final GCD.
              __UpperCamelCase       ,						__UpperCamelCase       =  y, x % y
       return abs(SCREAMING_SNAKE_CASE__     )
def 				lowercase__   (   ) ->      Dict:



       """simple docstring"""






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


if __name__ == "__main__":
    main()




from numpy import exp, pi, sqrt

def 						_UpperCAmelCase				(			SCREAMING_SNAKE_CASE__			:					Tuple			,     SCREAMING_SNAKE_CASE__			:					float = 0.0			,     SCREAMING_SNAKE_CASE__			:					float = 1.0				):
     return 1 / sqrt(2 * pi * sigma**2				) * exp(-((x - mu) ** 2) / (2 * sigma**2)				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()





