





"""simple docstring"""
def 					__lowerCamelCase       (							a_					:		int			,       a_					:		int							)      ->				int:
      while b:
            __SCREAMING_SNAKE_CASE       :Optional[int]		    =  b, a % b
      return a



def 					__lowerCamelCase       (							a_					:		int			,       a_					:		int							)      ->				int:
      return a if b == 0 else euclidean_gcd_recursive(a_			,       a % b							)



def 					__lowerCamelCase       (							)      ->				List[str]:
      print(f'''euclidean_gcd(3, 5) = {euclidean_gcd(3			,       5							)}'''							)
      print(f'''euclidean_gcd(5, 3) = {euclidean_gcd(5			,       3							)}'''							)
      print(f'''euclidean_gcd(1, 3) = {euclidean_gcd(1			,       3							)}'''							)
      print(f'''euclidean_gcd(3, 6) = {euclidean_gcd(3			,       6							)}'''							)
      print(f'''euclidean_gcd(6, 3) = {euclidean_gcd(6			,       3							)}'''							)

      print(f'''euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3			,       5							)}'''							)
      print(f'''euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5			,       3							)}'''							)
      print(f'''euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1			,       3							)}'''							)
      print(f'''euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3			,       6							)}'''							)
      print(f'''euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6			,       3							)}'''							)


if __name__ == "__main__":
  main()






"""simple docstring"""
import math
import random



def 					__lowerCamelCase       (							a_					:		float			,       a_					:		bool = False							)      ->				float:
      if deriv:
            return value * (1 - value)
      return 1 / (1 + math.exp(-value							))


# Initial Value
lowerCamelCase_       =		0.02



def 					__lowerCamelCase       (							a_					:		int			,       a_					:		int							)      ->				float:
      __SCREAMING_SNAKE_CASE       :Any		    =  float(2 * (random.randint(1			,       1_00							)) - 1							)

      for _ in range(a_							):
            # Forward propagation
            __SCREAMING_SNAKE_CASE       :Any		    =  sigmoid_function(INITIAL_VALUE * weight							)
            # How much did we miss?
            __SCREAMING_SNAKE_CASE       :Tuple		    =  (expected / 1_00) - layer_a
            # Error delta
            __SCREAMING_SNAKE_CASE       :Union[str, Any]		    =  layer_1_error * sigmoid_function(a_			,       a_							)
            # Update weight
            weight += INITIAL_VALUE * layer_1_delta

      return layer_a * 1_00


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  lowerCamelCase_       =		int(input("Expected value: "))
  lowerCamelCase_       =		int(input("Number of propagations: "))
  print(forward_propagation(expected, number_propagations))