




from __future__ import annotations




def       SCREAMING_SNAKE_CASE			( __UpperCamelCase    :		int ,  __UpperCamelCase    :		list[int] ,  __UpperCamelCase    :		list[int] ,  __UpperCamelCase    :		int   )						->							int:

    # Base Case
    if counter == 0 or capacity == 0:
        return 0

    # If weight of the nth item is more than Knapsack of capacity,
    #   then this item cannot be included in the optimal solution,
    # else return the maximum of two cases:
    #   (1) nth item included
    #   (2) not included
    if weights[counter - 1] > capacity:
        return knapsack(__UpperCamelCase ,  __UpperCamelCase ,  __UpperCamelCase ,  counter - 1   )
    else:
        UpperCAmelCase_											=  capacity - weights[counter - 1]
        UpperCAmelCase_											=  values[counter - 1] + knapsack(
            __UpperCamelCase ,  __UpperCamelCase ,  __UpperCamelCase ,  counter - 1   )
        UpperCAmelCase_											=  knapsack(__UpperCamelCase ,  __UpperCamelCase ,  __UpperCamelCase ,  counter - 1   )
        return max(__UpperCamelCase ,  __UpperCamelCase   )


if __name__ == "__main__":
 import doctest

 doctest.testmod()











import decimal




def       SCREAMING_SNAKE_CASE			( )						->							int:
    UpperCAmelCase_											=  0
    UpperCAmelCase_											=  decimal.Context(prec=105   )
    for i in range(2 ,  100   ):
        UpperCAmelCase_											=  decimal.Decimal(__UpperCamelCase   )
        UpperCAmelCase_											=  number.sqrt(__UpperCamelCase   )
        if len(str(__UpperCamelCase   )   ) > 1:
            answer += int(str(__UpperCamelCase   )[0]   )
            UpperCAmelCase_											=  str(__UpperCamelCase   )[2:101]
            answer += sum(int(__UpperCamelCase   ) for x in sqrt_number_str   )
    return answer


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 print(F"{solution() = }")





