




'''simple docstring'''





def 					UpperCamelCase_(     snake_case							:	int							,    snake_case							:	int					):

							'''simple docstring'''






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


def 					UpperCamelCase_(     ):

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





def 					UpperCamelCase_(     snake_case							:	int = 1_0_0_0_0_0_0					):

							'''simple docstring'''






							snake_case_      =				set(range(3							,    snake_case							,    2					)					)
							primes.add(2					)
							for p in range(3							,    snake_case							,    2					):
														if p not in primes:
																					continue
														primes.difference_update(set(range(p * p							,    snake_case							,    snake_case					)					)					)

							snake_case_      =				[float(snake_case					) for n in range(limit + 1					)]

							for p in primes:
														for n in range(snake_case							,    limit + 1							,    snake_case					):
																					phi[n] *= 1 - 1 / p

							return int(sum(phi[2:]					)					)


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




