



def    snake_case_				(    _SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE   ):
 return abs(__A   ) if a == 0 else greatest_common_divisor(b % a  ,	__A   )



def    snake_case_				(    _SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE   ):
 while y:  # --> when y=0 then loop will terminate and return x as final GCD.
  __lowercase       ,    __lowercase		       =			y, x % y
 return abs(__A   )



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


if __name__ == "__main__":
 main()








def    snake_case_				(    _SCREAMING_SNAKE_CASE   ):

	# bit count represents no. of bits in the gray code
	if bit_count < 0:
		raise ValueError("The given input must be positive"   )

	# get the generated string sequence
	__lowercase		       =			gray_code_sequence_string(_SCREAMING_SNAKE_CASE   )
	#
	# convert them to integers
	for i in range(len(_SCREAMING_SNAKE_CASE   )   ):
		__lowercase		       =			int(sequence[i]  ,	2   )

	return sequence



def    snake_case_				(    _SCREAMING_SNAKE_CASE   ):

	# The approach is a recursive one
	# Base case achieved when either n = 0 or n=1
	if bit_count == 0:
		return ["0"]

	if bit_count == 1:
		return ["0", "1"]

	__lowercase		       =			1 << bit_count  # defines the length of the sequence
	# 1<< n is equivalent to 2^n

	# recursive answer will generate answer for n-1 bits
	__lowercase		       =			gray_code_sequence_string(bit_count - 1   )

	__lowercase		       =			[]

	# append 0 to first half of the smaller sequence generated
	for i in range(seq_len // 2   ):
		__lowercase		       =			"0" + smaller_sequence[i]
		sequence.append(_SCREAMING_SNAKE_CASE   )

	# append 1 to second half ... start from the end of the list
	for i in reversed(range(seq_len // 2   )   ):
		__lowercase		       =			"1" + smaller_sequence[i]
		sequence.append(_SCREAMING_SNAKE_CASE   )

	return sequence


if __name__ == "__main__":
	import doctest

	doctest.testmod()



