



def 	_lowerCAmelCase (    A__    ,	A__ = 0						):
      lowercase__  =	length or len(A__						)
      lowercase__  =	False
      for i in range(length - 1						):
            if list_data[i] > list_data[i + 1]:
                  lowercase__,						lowercase__  =	list_data[i + 1], list_data[i]
                  lowercase__  =	True

      return list_data if not swapped else bubble_sort(A__    ,	length - 1						)


if __name__ == "__main__":
       import doctest

       doctest.testmod()





def 	_lowerCAmelCase (    A__ = 50_000_000						):
      lowercase__  =	set()
      lowercase__  =	int((limit - 24) ** (1 / 2)						)

      lowercase__  =	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    ,	A__						)						)						)

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

      return len(A__						)


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