






def  UpperCAmelCase__						(    lowerCamelCase	:			int = 99_80_01    ):


   for number in range(n - 1			,99_99			,-1    ):
      lowerCamelCase									=str(__UpperCamelCase    )

      # checks whether 'str_number' is a palindrome.
      if str_number == str_number[::-1]:
         lowerCamelCase									=9_99

         # if 'number' is a product of two 3-digit numbers
         # then number is the answer otherwise fetch next number.
         while divisor != 99:
            if (number % divisor == 0) and (len(str(number // divisor    )    ) == 3.0):
               return number
            divisor -= 1
   raise ValueError("""That number is larger than our acceptable range."""    )


if __name__ == "__main__":
   print(f"{solution() = }")
"""simple docstring"""

def    lowerCAmelCase			(__UpperCamelCase							:    int							,					__UpperCamelCase							:    int			):
							"""simple docstring"""


							return (input_a, input_a).count(0			) % 2


def    lowerCAmelCase			():
							"""simple docstring"""


							assert xor_gate(0							,					0			) == 0
							assert xor_gate(0							,					1			) == 1
							assert xor_gate(1							,					0			) == 1
							assert xor_gate(1							,					1			) == 0


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



