



from __future__ import annotations

from bisect import bisect_left
from functools import total_ordering
from heapq import merge

@total_ordering
class 				snake_case__(_UpperCamelCase      ):

					"""simple docstring"""






					def __lt__(							self :     Optional[Any]				,       SCREAMING_SNAKE_CASE :     int					):
								return self[-1] < other[-1]







					def __eq__(							self :     Dict				,       SCREAMING_SNAKE_CASE :     str					):
								return self[-1] == other[-1]






def  __lowerCamelCase (       lowerCamelCase__						):

			"""simple docstring"""


			lowercase__					:   list[Stack]													=					[]
			# sort into stacks
			for element in collection:
						lowercase__					:   List[str]													=					Stack([element]						)
						lowercase__					:   int													=					bisect_left(lowerCamelCase__					,			lowerCamelCase__						)
						if i != len(lowerCamelCase__						):
									stacks[i].append(lowerCamelCase__						)
						else:
									stacks.append(lowerCamelCase__						)

    # use a heap-based merge to merge stack efficiently
			lowercase__					:   List[Any]													=					merge(*(reversed(lowerCamelCase__						) for stack in stacks)						)
			return collection


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









from collections import Counter
from timeit import timeit


def  __lowerCamelCase (       lowerCamelCase__ = ""					,			):

				"""simple docstring"""


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


def  __lowerCamelCase (       lowerCamelCase__ = ""						):

				"""simple docstring"""


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

				for character in lower_case_input_str:
								lowercase__					:   List[Any]													=					character_freq_dict.get(lowerCamelCase__					,			0						) + 1
				lowercase__					:   List[Any]													=					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  __lowerCamelCase (       lowerCamelCase__ = ""						):

				"""simple docstring"""


				print("\nFor string = "					,			lowerCamelCase__					,			":"						)
				print(
				    "> can_string_be_rearranged_as_palindrome_counter()"					,			"\tans ="					,			can_string_be_rearranged_as_palindrome_counter(lowerCamelCase__						)					,			"\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(lowerCamelCase__						)					,			"\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''')




