




from collections.abc import Sequence



def       UpperCAmelCase__  (     lowerCamelCase = None   ):
  if nums is None or not nums:
    raise ValueError("Input sequence should not be empty"   )

  lowercase    :int      	=						nums[0]
  for i in range(1,			len(lowerCamelCase   )   ):
    lowercase    :Dict      	=						nums[i]
    lowercase    :Optional[int]      	=						max(lowerCamelCase,			ans + num,			lowerCamelCase   )

  return ans


if __name__ == "__main__":
     import doctest

     doctest.testmod()

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









_UpperCAmelCase	:						Union[str, Any]			=     "0.21.0"

from .accelerator import Accelerator
from .big_modeling import (
    cpu_offload,
    cpu_offload_with_hook,
    disk_offload,
    dispatch_model,
    init_empty_weights,
    init_on_device,
    load_checkpoint_and_dispatch,
)
from .data_loader import skip_first_batches
from .launchers import debug_launcher, notebook_launcher
from .state import PartialState
from .utils import (
    DeepSpeedPlugin,
    DistributedDataParallelKwargs,
    DistributedType,
    FullyShardedDataParallelPlugin,
    GradScalerKwargs,
    InitProcessGroupKwargs,
    find_executable_batch_size,
    infer_auto_device_map,
    is_rich_available,
    load_checkpoint_in_model,
    synchronize_rng_states,
)


if is_rich_available():
     from .utils import rich



