

from math import factorial
def 						_snake_case(   SCREAMING_SNAKE_CASE__      :     int   ,      SCREAMING_SNAKE_CASE__      :     int				)							->				int:





    '''simple docstring'''






    if n < k or k < 0:
        raise ValueError('Please enter positive integers for n and k where n >= k'				)
    return factorial(SCREAMING_SNAKE_CASE__				) // (factorial(SCREAMING_SNAKE_CASE__				) * factorial(n - k				))


if __name__ == "__main__":
     print(
         "The number of five-card hands possible from a standard",
         f"""fifty-two card deck is: {combinations(52, 5)}\n""",
     )

     print(
         "If a class of 40 students must be arranged into groups of",
         f"""4 for group projects, there are {combinations(40, 4)} ways""",
         "to arrange them.\n",
     )

     print(
         "If 10 teams are competing in a Formula One race, there",
         f"""are {combinations(10, 3)} ways that first, second and""",
         "third place can be awarded.",
     )




from collections.abc import Sequence
def 						_snake_case(   SCREAMING_SNAKE_CASE__      :     Sequence[int] | None = None				)							->				int:





    '''simple docstring'''






    if nums is None or not nums:
        raise ValueError('Input sequence should not be empty'				)

    A__   				=       nums[0]
    for i in range(1   ,      len(SCREAMING_SNAKE_CASE__				)				):
        A__   				=       nums[i]
        A__   				=       max(SCREAMING_SNAKE_CASE__   ,      ans + num   ,      SCREAMING_SNAKE_CASE__				)

    return ans


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     # Try on a sample input from the user
     lowercase_			=  int(input("Enter number of elements : ").strip())
     lowercase_			=  list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
     print(max_subsequence_sum(array))

