'''simple docstring'''




def 							lowerCamelCase	(      UpperCAmelCase__       :					int      ,      UpperCAmelCase__       :					int )			->      int:
							while b:
														lowercase_						,						lowercase_					:			List[Any]										=       b, a % b
							return a




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




def 							lowerCamelCase	(      )			->      List[Any]:
							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'''




def 							lowerCamelCase	(      UpperCAmelCase__       :					int      ,      UpperCAmelCase__       :					int )			->      bool:
							return numa ^ numa < 0


if __name__ == "__main__":
						import doctest

						doctest.testmod()





