


'''simple docstring'''






def      UpperCAmelCase      (		lowerCamelCase_  :int = 50_00_00_00 ):







		'''simple docstring'''
		snake_case_		:							Dict			       =						set()
		snake_case_		:							List[str]			       =						int((limit - 24) ** (1 / 2) )

		snake_case_		:							List[str]			       =						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				,      lowerCamelCase_ ) ) )

		for primea in primes:
				snake_case_		:							List[Any]			       =						primea * primea
				for primea in primes:
						snake_case_		:							List[Any]			       =						primea * primea * primea
						if square + cube >= limit - 16:
								break
						for primea in primes:
								snake_case_		:							int			       =						primea * primea * primea * primea
								snake_case_		:							Union[str, Any]			       =						square + cube + tetr
								if total >= limit:
										break
								ret.add(lowerCamelCase_ )

		return len(lowerCamelCase_ )


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



'''simple docstring'''






from abc import ABC, abstractmethod
from argparse import ArgumentParser
class 						__UpperCamelCase	(						lowercase__							):





							@staticmethod
							@abstractmethod
							def 		a__   (  _UpperCamelCase		:ArgumentParser			):
									raise NotImplementedError()





							@abstractmethod
							def 		a__   (  self		:Optional[Any]			):
									raise NotImplementedError()