"""simple docstring"""






def      UpperCAmelCase__			(							lowerCAmelCase__	:int   ,						lowerCAmelCase__	:int						)					->       int:
      '''simple docstring'''


      return int((input_a, input_a).count(1						) != 0						)


def      UpperCAmelCase__			(							)					->       None:
      '''simple docstring'''


      assert or_gate(0   ,						0						) == 0
      assert or_gate(0   ,						1						) == 1
      assert or_gate(1   ,						0						) == 1
      assert or_gate(1   ,						1						) == 1


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




"""simple docstring"""






import math


def      UpperCAmelCase__			(							lowerCAmelCase__	:int						)					->       bool:
      '''simple docstring'''


      lowercase								=      math.loga(math.sqrt(4 * positive_integer + 1						) / 2 + 1 / 2						)

      return exponent == int(lowerCAmelCase__						)


def      UpperCAmelCase__			(							lowerCAmelCase__	:float = 1 / 1_2_3_4_5						)					->       int:
      '''simple docstring'''


      lowercase								=      0
      lowercase								=      0

      lowercase								=      3
      while True:
            lowercase								=      (integer**2 - 1) / 4
            # if candidate is an integer, then there is a partition for k
            if partition_candidate == int(lowerCAmelCase__						):
                  lowercase								=      int(lowerCAmelCase__						)
                  total_partitions += 1
                  if check_partition_perfect(lowerCAmelCase__						):
                        perfect_partitions += 1
            if perfect_partitions > 0:
                  if perfect_partitions / total_partitions < max_proportion:
                        return int(lowerCAmelCase__						)
            integer += 1


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



