


'''simple docstring'''






class  __magic_name__							:






       def __init__(      self  ,							snake_case)						->  str:




          '''simple docstring'''
          # we need a list not a string, so do something to change the type
          _UpperCAmelCase       :       List[str]							   =arr.split(',')






       def       lowerCAmelCase		(      self)						->  Union[str, Any]:




          '''simple docstring'''
          _UpperCAmelCase       :       Optional[int]							   =[int(self.array[0])] * len(self.array)
          _UpperCAmelCase       :       Union[str, Any]							   =[int(self.array[0])] * len(self.array)
          for i in range(1  ,							len(self.array)):
             _UpperCAmelCase       :       Union[str, Any]							   =max(
                 int(self.array[i]) + sum_value[i - 1]  ,							int(self.array[i]))
             _UpperCAmelCase       :       Optional[int]							   =max(sum_value[i]  ,							rear[i - 1])
          return rear[len(self.array) - 1]


if __name__ == "__main__":
 lowercase							=input('please input some numbers:')
 lowercase							=SubArray(whole_array)
 lowercase							=array.solve_sub_array()
 print(('the results is:', re))





'''simple docstring'''






lowercase							=[0, 2, 4, 6, 8]
lowercase							=[1, 3, 5, 7, 9]





def lowerCamelCase__      (						__lowerCamelCase	:							int	,   __lowerCamelCase	:							int	,   __lowerCamelCase	:							list[int]	,   __lowerCamelCase	:							int							):







   '''simple docstring'''




   if remaining_length == 0:
      if digits[0] == 0 or digits[-1] == 0:
         return 0

      for i in range(length // 2 - 1	,   -1	,   -1							):
         remainder += digits[i] + digits[length - i - 1]

         if remainder % 2 == 0:
            return 0

         remainder //= 1_0

      return 1

   if remaining_length == 1:
      if remainder % 2 == 0:
         return 0

      _UpperCAmelCase       :       Union[str, Any]							   =0
      for digit in range(1_0							):
         _UpperCAmelCase       :       str							   =digit
         result += reversible_numbers(
             0	,   (remainder + 2 * digit) // 1_0	,   __lowerCamelCase	,   __lowerCamelCase							)
      return result

   _UpperCAmelCase       :       Optional[Any]							   =0
   for digita in range(1_0							):
      _UpperCAmelCase       :       Any							   =digita

      if (remainder + digita) % 2 == 0:
         _UpperCAmelCase       :       Optional[int]							   =ODD_DIGITS
      else:
         _UpperCAmelCase       :       Union[str, Any]							   =EVEN_DIGITS

      for digita in other_parity_digits:
         _UpperCAmelCase       :       int							   =digita
         result += reversible_numbers(
             remaining_length - 2	,   (remainder + digita + digita) // 1_0	,   __lowerCamelCase	,   __lowerCamelCase	,   )
   return result





def lowerCamelCase__      (						__lowerCamelCase	:							int = 9							):







   '''simple docstring'''




   _UpperCAmelCase       :       Optional[int]							   =0
   for length in range(1	,   max_power + 1							):
      result += reversible_numbers(__lowerCamelCase	,   0	,   [0] * length	,   __lowerCamelCase							)
   return result


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

