
def 			a_						(			__lowercase  :      int			,   __lowercase  :      int					)					->    int:
			return 1 if input_a == input_a else 0






def 			a_						(			)					->    None:
			assert xnor_gate(0			,   0					) == 1
			assert xnor_gate(0			,   1					) == 0
			assert xnor_gate(1			,   0					) == 0
			assert xnor_gate(1			,   1					) == 1


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







'''simple docstring'''



from math import isqrt


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



 """simple docstring"""




 lowercase       : Dict						=[True] * max_number
 for i in range(2       ,   isqrt(max_number - 1      ) + 1      ):
  if is_prime[i]:
   for j in range(i**2       ,   __A       ,   __A      ):
    lowercase       : str						=False

 return [i for i in range(2       ,   __A      ) if is_prime[i]]


def 				lowercase_					(     __A			:							int = 1_0**8      )							->   int:



 """simple docstring"""




 lowercase       : Dict						=calculate_prime_numbers(max_number // 2      )

 lowercase       : str						=0
 lowercase       : Optional[Any]						=0
 lowercase       : Union[str, Any]						=len(__A      ) - 1
 while left <= right:
  while prime_numbers[left] * prime_numbers[right] >= max_number:
   right -= 1
  semiprimes_count += right - left + 1
  left += 1

 return semiprimes_count


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



