import numpy as np




def 							UpperCamelCase		(			__lowercase		:					np.array      ):
		'''simple docstring'''




		return 1 / (1 + np.exp(-vector      ))




def 							UpperCamelCase		(			__lowercase		:					np.array      ):
		'''simple docstring'''




		return vector * sigmoid(1.7_02 * vector      )


if __name__ == "__main__":
	import doctest

	doctest.testmod()







def 							UpperCamelCase		(			__lowercase		:					Optional[Any]		,__lowercase		:					List[Any]		,__lowercase		:					Tuple      ):
		'''simple docstring'''




		if n == 0:
				return 1

		elif n % 2 == 1:
				return (binary_exponentiation(__lowercase		,n - 1		,__lowercase      ) * a) % mod

		else:
				A_						:							str      = binary_exponentiation(__lowercase		,n / 2		,__lowercase      )
				return (b * b) % mod


# a prime number
_UpperCAmelCase          =						701

_UpperCAmelCase          =						1000000000
_UpperCAmelCase          =						10

# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)


print((a / b) % p == (a * b ** (p - 2)) % p)






