






'''simple docstring'''



def 							lowercase_				(    __A :       int					,      __A :       int			)       ->      int:



 """simple docstring"""




 return 1 if input_a == input_a else 0


def 							lowercase_				(    )       ->      None:



 """simple docstring"""




 assert xnor_gate(0					,      0			) == 1
 assert xnor_gate(0					,      1			) == 0
 assert xnor_gate(1					,      0			) == 0
 assert xnor_gate(1					,      1			) == 1


if __name__ == "__main__":
 print(xnor_gate(0, 0))
 print(xnor_gate(0, 1))
 print(xnor_gate(1, 0))
 print(xnor_gate(1, 1))











'''simple docstring'''



def 							lowercase_				(    __A :       int					,      __A :       int			)       ->      str:



 """simple docstring"""




 if number < 0 or shift_amount < 0:
  raise ValueError('''both inputs must be positive integers'''			)

 lowercase					:   List[Any]				  =str(bin(__A			)			)
 binary_number += "0" * shift_amount
 return binary_number


def 							lowercase_				(    __A :       int					,      __A :       int			)       ->      str:



 """simple docstring"""




 if number < 0 or shift_amount < 0:
  raise ValueError('''both inputs must be positive integers'''			)

 lowercase					:   Union[str, Any]				  =str(bin(__A			)			)[2:]
 if shift_amount >= len(__A			):
  return "0b0"
 lowercase					:   Any				  =binary_number[: len(__A			) - shift_amount]
 return "0b" + shifted_binary_number


def 							lowercase_				(    __A :       int					,      __A :       int			)       ->      str:



 """simple docstring"""




 if number >= 0:  # Get binary representation of positive number
  lowercase					:   str				  ='''0''' + str(bin(__A			)			).strip('''-'''			)[2:]
 else:  # Get binary (2's complement) representation of negative number
  lowercase					:   Dict				  =len(bin(__A			)[3:]			)  # Find 2's complement of number
  lowercase					:   Optional[Any]				  =bin(abs(__A			) - (1 << binary_number_length)			)[3:]
  lowercase					:   int				  =(
      '''1''' + '''0''' * (binary_number_length - len(__A			)) + binary_number
  )

 if shift_amount >= len(__A			):
  return "0b" + binary_number[0] * len(__A			)
 return (
     "0b"
     + binary_number[0] * shift_amount
     + binary_number[: len(__A			) - shift_amount]
 )


if __name__ == "__main__":
      import doctest

      doctest.testmod()



