


"""simple docstring"""



def      UpperCAmelCase     (       _lowercase :   Optional[Any]			,   _lowercase :   Dict	)						-> int:


	"""simple docstring"""




	return 1 if input_a == input_a else 0
def      UpperCAmelCase     (       )						-> None:


	"""simple docstring"""




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

def  __lowerCamelCase					( _lowercase = 50000000			)       ->      int:
     UpperCamelCase						    =					set()
     UpperCamelCase						    =					int((limit - 24) ** (1 / 2)			)

     UpperCamelCase						    =					set(range(3						,     prime_square_limit + 1						,     2			)			)
     primes.add(2			)
     for p in range(3						,     prime_square_limit + 1						,     2			):
          if p not in primes:
               continue
          primes.difference_update(set(range(p * p						,     prime_square_limit + 1						,     _lowercase			)			)			)

     for primea in primes:
          UpperCamelCase						    =					primea * primea
          for primea in primes:
               UpperCamelCase						    =					primea * primea * primea
               if square + cube >= limit - 16:
                    break
               for primea in primes:
                    UpperCamelCase						    =					primea * primea * primea * primea
                    UpperCamelCase						    =					square + cube + tetr
                    if total >= limit:
                         break
                    ret.add(_lowercase			)

     return len(_lowercase			)


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


