


"""simple docstring"""


from __future__ import annotations

import time

import numpy as np

A     :   Union[str, Any]			    =			[8, 5, 9, 7]
A     :   Dict			    =			[
    [2, 0, 1, 1],
    [0, 1, 2, 1],
    [4, 0, 0, 3],
    [0, 2, 1, 0],
    [1, 0, 3, 0],
]
A     :   Optional[Any]			    =			[
    [3, 2, 1, 4],
    [0, 2, 5, 2],
    [5, 1, 0, 5],
    [1, 5, 3, 0],
    [3, 0, 3, 3],
]
class   _UpperCamelCase  :
							'''simple docstring'''







							def __init__(     self    ,   __a    ,   __a    ,   __a    ,   ):
										__lowerCAmelCase				    =			claim_vector
										__lowerCAmelCase				    =			allocated_resources_table
										__lowerCAmelCase				    =			maximum_claim_table

							def 			snake_case				(     self	):
										return [
										    sum(p_item[i] for p_item in self.__allocated_resources_table	)
										    for i in range(len(self.__allocated_resources_table[0]	)	)
										]

							def 			snake_case				(     self	):
										return np.array(self.__claim_vector	) - np.array(
										    self.__processes_resource_summation()	)

							def 			snake_case				(     self	):
										return [
										    list(np.array(self.__maximum_claim_table[i]	) - np.array(__a	)	)
										    for i, allocated_resource in enumerate(self.__allocated_resources_table	)
										]

							def 			snake_case				(     self	):
										return {self.__need().index(__a	): i for i in self.__need()}

							def 			snake_case				(     self    ,   **__a	):
										__lowerCAmelCase				    =			self.__need()
										__lowerCAmelCase				    =			self.__allocated_resources_table
										__lowerCAmelCase				    =			self.__available_resources()
										__lowerCAmelCase				    =			self.__need_index_manager()
										for kw, val in kwargs.items():
													if kw and val is True:
																self.__pretty_data()
										print("_" * 50 + "\n"	)
										while need_list:
													__lowerCAmelCase				    =			False
													for each_need in need_list:
																__lowerCAmelCase				    =			True
																for index, need in enumerate(__a	):
																			if need > available_resources[index]:
																						__lowerCAmelCase				    =			False
																						break
																if execution:
																			__lowerCAmelCase				    =			True
																			# get the original index of the process from ind_ctrl db
																			for original_need_index, need_clone in need_index_manager.items():
																						if each_need == need_clone:
																									__lowerCAmelCase				    =			original_need_index
																			print(f"Process {process_number + 1} is executing."	)
																			# remove the process run from stack
																			need_list.remove(__a	)
																			# update available/freed resources stack
																			__lowerCAmelCase				    =			np.array(__a	) + np.array(
																			    alloc_resources_table[process_number]	)
																			print(
																			    "Updated available resource stack for processes: "
																			    + " ".join([str(__a	) for x in available_resources]	)	)
																			break
													if safe:
																print("The process is in a safe state.\n"	)
													else:
																print("System in unsafe state. Aborting...\n"	)
																break



							def 			snake_case				(     self	):
										print(" " * 9 + "Allocated Resource Table"	)
										for item in self.__allocated_resources_table:
													print(
													    f"P{self.__allocated_resources_table.index(__a	) + 1}"
													    + " ".join(f"{it:>8}" for it in item	)
													    + "\n"	)
										print(" " * 9 + "System Resource Table"	)
										for item in self.__maximum_claim_table:
													print(
													    f"P{self.__maximum_claim_table.index(__a	) + 1}"
													    + " ".join(f"{it:>8}" for it in item	)
													    + "\n"	)
										print(
										    "Current Usage by Active Processes: "
										    + " ".join(str(__a	) for x in self.__claim_vector	)	)
										print(
										    "Initial Available Resources:       "
										    + " ".join(str(__a	) for x in self.__available_resources()	)	)
										time.sleep(1	)


if __name__ == "__main__":
	import doctest

	doctest.testmod()








"""simple docstring"""


def _lowerCamelCase	(		_UpperCamelCase      ):

			'''simple docstring'''




			__lowerCAmelCase				    =			False
			while is_sorted is False:  # Until all the indices are traversed keep looping
						__lowerCAmelCase				    =			True
						for i in range(0    , len(_UpperCamelCase      ) - 1    , 2      ):  # iterating over all even indices
									if input_list[i] > input_list[i + 1]:
												__lowerCAmelCase    ,	__lowerCAmelCase				    =			input_list[i + 1], input_list[i]
												# swapping if elements not in order
												__lowerCAmelCase				    =			False

						for i in range(1    , len(_UpperCamelCase      ) - 1    , 2      ):  # iterating over all odd indices
									if input_list[i] > input_list[i + 1]:
												__lowerCAmelCase    ,	__lowerCAmelCase				    =			input_list[i + 1], input_list[i]
												# swapping if elements not in order
												__lowerCAmelCase				    =			False
			return input_list


if __name__ == "__main__":
	print("Enter list to be sorted")
	A     :   Union[str, Any]			    =			[int(x) for x in input().split()]
	# inputing elements of the list in one line
	A     :   str			    =			odd_even_sort(input_list)
	print("The sorted list is")
	print(sorted_list)




