code: 
  
  
  
  
  
  '''simple docstring'''
  
  
  
  
  from __future__ import annotations
  
  import sys
  
  
  
  
  def 	__lowerCamelCase (  UpperCAmelCase_				,							UpperCAmelCase_       )      ->tuple[int, int]:
  	# base cases
  	if abs(UpperCAmelCase_       ) == 1:
  		return a, 0
  	elif abs(UpperCAmelCase_       ) == 1:
  		return 0, b
  
  	snake_case__					,     snake_case__  					=      a, b
  	snake_case__					,     snake_case__  					=      1, 0
  	snake_case__					,     snake_case__  					=      0, 1
  
  	while remainder != 0:
  		snake_case__  					=      old_remainder // remainder
  		snake_case__					,     snake_case__  					=      remainder, old_remainder - quotient * remainder
  		snake_case__					,     snake_case__  					=      coeff_a, old_coeff_a - quotient * coeff_a
  		snake_case__					,     snake_case__  					=      coeff_b, old_coeff_b - quotient * coeff_b
  
  	# sign correction for negative numbers
  	if a < 0:
  		snake_case__  					=      -old_coeff_a
  	if b < 0:
  		snake_case__  					=      -old_coeff_b
  
  	return old_coeff_a, old_coeff_b
  
  
  
  
  def 	__lowerCamelCase (  )      ->Any:
  	if len(sys.argv       ) < 3:
  		print('2 integer arguments required'       )
  		return 1
  	snake_case__  					=      int(sys.argv[1]       )
  	snake_case__  					=      int(sys.argv[2]       )
  	print(extended_euclidean_algorithm(UpperCAmelCase_				,							UpperCAmelCase_       )       )
  	return 0
  
  
  if __name__ == "__main__":
  			raise SystemExit(main())
  
  
  
  
style_context: 
  
  
  
  
  
  '''simple docstring'''
  
  
  
  
  def 	__lowerCamelCase (  UpperCAmelCase_       )      ->int:
  	return 1 if input_a == 0 else 0
  
  
  
  
  def 	__lowerCamelCase (  )      ->None:
  	assert not_gate(0       ) == 1
  	assert not_gate(1       ) == 0
  
  
  if __name__ == "__main__":
  			print(not_gate(0))
  			print(not_gate(1))
  
  
  
  