




"""simple docstring"""







def 						snake_case__       (					_lowerCamelCase,  _lowerCamelCase				)			->int:






		"""simple docstring"""


		return int(input_a == input_a == 0				)

def 						snake_case__       (					)			->None:






		"""simple docstring"""


		print("Truth Table of NOR Gate:"				)
		print("|   Input 1   |  Input 2  | Output |"				)
		print(F'|      0      |    0      |  {nor_gate(0,  0				)}     |'				)
		print(F'|      0      |    1      |  {nor_gate(0,  1				)}     |'				)
		print(F'|      1      |    0      |  {nor_gate(1,  0				)}     |'				)
		print(F'|      1      |    1      |  {nor_gate(1,  1				)}     |'				)


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						main()






"""simple docstring"""







def 						snake_case__       (					_lowerCamelCase,  _lowerCamelCase				)			->int:






		"""simple docstring"""


		return abs(_lowerCamelCase				) if a == 0 else greatest_common_divisor(b % a,  _lowerCamelCase				)

def 						snake_case__       (					_lowerCamelCase,  _lowerCamelCase				)			->int:






		"""simple docstring"""


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

def 						snake_case__       (					)			->Optional[int]:






		"""simple docstring"""


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


if __name__ == "__main__":
						main()
