


from collections import Counter
from timeit import timeit




def    a   (							A__ = ""      ,    )	-> bool:




      '''simple docstring'''

      return sum(c % 2 for c in Counter(input_str.replace(''' '''      ,    ''''''							).lower()							).values()							) < 2




def    a   (							A__ = ""							)	-> bool:




      '''simple docstring'''

      if len(A__							) == 0:
            return True
      SCREAMING_SNAKE_CASE__       :  int						     =		input_str.replace(''' '''      ,    ''''''							).lower()
      # character_freq_dict: Stores the frequency of every character in the input string
      SCREAMING_SNAKE_CASE__       :  dict[str, int]						     =		{}

      for character in lower_case_input_str:
            SCREAMING_SNAKE_CASE__       :  Union[str, Any]						     =		character_freq_dict.get(A__      ,    0							) + 1
      SCREAMING_SNAKE_CASE__       :  str						     =		0

      for character_count in character_freq_dict.values():
            if character_count % 2:
                  odd_char += 1
      if odd_char > 1:
            return False
      return True




def    a   (							A__ = ""							)	-> None:




      '''simple docstring'''

      print('''\nFor string = '''      ,    A__      ,    ''':'''							)
      print(
          '''> can_string_be_rearranged_as_palindrome_counter()'''      ,    '''\tans ='''      ,    can_string_be_rearranged_as_palindrome_counter(A__							)      ,    '''\ttime ='''      ,    timeit(
              '''z.can_string_be_rearranged_as_palindrome_counter(z.check_str)'''      ,    setup='''import __main__ as z'''      ,    )      ,    '''seconds'''      ,    )
      print(
          '''> can_string_be_rearranged_as_palindrome()'''      ,    '''\tans ='''      ,    can_string_be_rearranged_as_palindrome(A__							)      ,    '''\ttime ='''      ,    timeit(
              '''z.can_string_be_rearranged_as_palindrome(z.check_str)'''      ,    setup='''import __main__ as z'''      ,    )      ,    '''seconds'''      ,    )


if __name__ == "__main__":
    a_ :Tuple  							=			input(
        'Enter string to determine if it can be rearranged as a palindrome or not: '
    ).strip()
    benchmark(check_str)
    a_ :List[Any]  							=			can_string_be_rearranged_as_palindrome_counter(check_str)
    print(F'''{check_str} can {'' if status else 'not '}be rearranged as a palindrome''')








from collections.abc import Sequence


def 				__A(lowerCAmelCase = None			)		->					int:

		"""simple docstring"""






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

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

		return ans


if __name__ == "__main__":
		import doctest

		doctest.testmod()

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



