




from collections import Counter
from timeit import timeit




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						str = ""	,					)  ->							bool:
    return sum(c % 2 for c in Counter(input_str.replace(''' '''	,					''''''				).lower()				).values()				) < 2




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						str = ""				)  ->							bool:
    if len(__UpperCamelCase				) == 0:
        return True
    UpperCAmelCase_										=					input_str.replace(''' '''	,					''''''				).lower()
    # character_freq_dict: Stores the frequency of every character in the input string
    UpperCAmelCase_										=					{}

    for character in lower_case_input_str:
        UpperCAmelCase_										=					character_freq_dict.get(__UpperCamelCase	,					0				) + 1
    UpperCAmelCase_										=					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  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						str = ""				)  ->							None:
    print('''\nFor string = '''	,					__UpperCamelCase	,					''':'''				)
    print(
        '''> can_string_be_rearranged_as_palindrome_counter()'''	,					'''\tans ='''	,					can_string_be_rearranged_as_palindrome_counter(__UpperCamelCase				)	,					'''\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(__UpperCamelCase				)	,					'''\ttime ='''	,					timeit(
            '''z.can_string_be_rearranged_as_palindrome(z.check_str)'''	,					setup='''import __main__ as z'''	,					)	,					'''seconds'''	,					)


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












def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						Optional[Any]				)  ->							Union[str, Any]:
    UpperCAmelCase_										=					len(__UpperCamelCase				)
    while cur > 1:
        # Find the maximum number in arr
        UpperCAmelCase_										=					arr.index(max(arr[0:cur]				)				)
        # Reverse from 0 to mi
        UpperCAmelCase_										=					arr[mi::-1] + arr[mi + 1 : len(__UpperCamelCase				)]
        # Reverse whole list
        UpperCAmelCase_										=					arr[cur - 1 :: -1] + arr[cur : len(__UpperCamelCase				)]
        cur -= 1
    return arr


if __name__ == "__main__":
 _lowerCamelCase      			=						input('Enter numbers separated by a comma:\n').strip()
 _lowerCamelCase      			=						[int(item) for item in user_input.split(',')]
 print(pancake_sort(unsorted))





