



'''simple docstring'''





def 							lowerCamelCase	(					_snake_case	:    Optional[Any]  ,_snake_case	:    Union[str, Any]  ,_snake_case	:    Dict  ,_snake_case	:    List[str]  ,_snake_case	:    List[str]  ,_snake_case	:    List[str]							):





    '''simple docstring'''


    if index == r:
        for j in range(_snake_case							):
            print(data[j]  ,end=" "							)
        print(" "							)
        return
    #  When no more elements are there to put in data[]
    if i >= n:
        return
    # current is included, put next at next location
    lowercase__									=    arr[i]
    combination_util(_snake_case  ,_snake_case  ,_snake_case  ,index + 1  ,_snake_case  ,i + 1							)
    # current is excluded, replace it with
    # next (Note that i+1 is passed, but
    # index is not changed)
    combination_util(_snake_case  ,_snake_case  ,_snake_case  ,_snake_case  ,_snake_case  ,i + 1							)
    # The main function that prints all combinations
    # of size r in arr[] of size n. This function
    # mainly uses combinationUtil()




def 							lowerCamelCase	(					_snake_case	:    Optional[Any]  ,_snake_case	:    Tuple  ,_snake_case	:    Union[str, Any]							):





    '''simple docstring'''


    lowercase__									=    [0] * r
    # Print all combination using temporary array 'data[]'
    combination_util(_snake_case  ,_snake_case  ,_snake_case  ,0  ,_snake_case  ,0							)


if __name__ == "__main__":
 # Driver code to check the function above
 SCREAMING_SNAKE_CASE__          =  [10, 20, 30, 40, 50]
 print_combination(arr, len(arr), 3)
 # This code is contributed by Ambuj sahu









'''simple docstring'''





def 							lowerCamelCase	(					_snake_case	:    int = 50_000_000							):





    '''simple docstring'''


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

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

    return len(_snake_case							)


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




