
"""simple docstring"""

def 							A		(       snake_case   :int       ,      snake_case   :int	)   ->			int:
 return int((input_a, input_a).count(1	) != 0	)






def 							A		(       )   ->			None:
 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"""

def 							A		(       snake_case   :int	)   ->			bool:
 return str(snake_case	) == str(snake_case	)[::-1]






def 							A		(       snake_case   :int	)   ->			int:
 return int(snake_case	) + int(str(snake_case	)[::-1]	)






def 							A		(       snake_case   :int = 1_0_0_0_0	)   ->			int:
 __UpperCamelCase       						= []
 for num in range(1       ,      snake_case	):
  __UpperCamelCase       						= 0
  __UpperCamelCase       						= num
  while iterations < 5_0:
   __UpperCamelCase       						= sum_reverse(snake_case	)
   iterations += 1
   if is_palindrome(snake_case	):
    break
  else:
   lychrel_nums.append(snake_case	)
 return len(snake_case	)


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



