


'''simple docstring'''







from __future__ import annotations







def _UpperCamelCase			(	__A       )				->						list[int]:


      '''simple docstring'''



      UpperCamelCase__      =							[0] * max_one

      for i in range(0 ,     __A       ):
            UpperCamelCase__      =							i

      for i in range(2 ,     __A       ):
            if totients[i] == i:
                  for j in range(__A ,     __A ,     __A       ):
                        totients[j] -= totients[j] // i

      return totients







def _UpperCamelCase			(	__A ,     __A       )				->						bool:


      '''simple docstring'''



      return sorted(str(__A       )       ) == sorted(str(__A       )       )







def _UpperCamelCase			(	__A = 10000000       )				->						int:


      '''simple docstring'''



      UpperCamelCase__      =							1  # i
      UpperCamelCase__      =							0  # φ(i)
      UpperCamelCase__      =							get_totients(max_n + 1       )

      for i in range(2 ,     max_n + 1       ):
            UpperCamelCase__      =							totients[i]

            if i * min_denominator < min_numerator * t and has_same_digits(__A ,     __A       ):
                  UpperCamelCase__      =							i
                  UpperCamelCase__      =							t

      return min_numerator


if __name__ == "__main__":
  print(F"""{solution() = }""")









'''simple docstring'''







def _UpperCamelCase			(	__A ,     __A       )				->						int:


      '''simple docstring'''



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







def _UpperCamelCase			(	)				->						None:


      '''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))





