


from __future__ import annotations

import time

import numpy as np

snake_case_						:			Optional[Any]													=							[8, 5, 9, 7]
snake_case_						:			str													=							[
    [2, 0, 1, 1],
    [0, 1, 2, 1],
    [4, 0, 0, 3],
    [0, 2, 1, 0],
    [1, 0, 3, 0],
]
snake_case_						:			Any													=							[
    [3, 2, 1, 4],
    [0, 2, 5, 2],
    [5, 1, 0, 5],
    [1, 5, 3, 0],
    [3, 0, 3, 3],
]

class 						A__							:




      def __init__(       self					:      List[str]				,    _a					:      int				,    _a					:      List[str]				,    _a					:      List[str]				,    )							->     Optional[int]:


          """simple docstring"""





          _SCREAMING_SNAKE_CASE			  =claim_vector
          _SCREAMING_SNAKE_CASE			  =allocated_resources_table
          _SCREAMING_SNAKE_CASE			  =maximum_claim_table




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


          """simple docstring"""





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




      def 							__UpperCamelCase				(       self					:      Optional[Any]  )							->     Any:


          """simple docstring"""





          return np.array(self.__claim_vector  ) - np.array(
              self.__processes_resource_summation()  )




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


          """simple docstring"""





          return [
              list(np.array(self.__maximum_claim_table[i]  ) - np.array(_a  )  )
              for i, allocated_resource in enumerate(self.__allocated_resources_table  )
          ]




      def 							__UpperCamelCase				(       self					:      Tuple  )							->     Any:


          """simple docstring"""





          return {self.__need().index(_a  ): i for i in self.__need()}




      def 							__UpperCamelCase				(       self					:      Optional[int]				,    **_a					:      Optional[Any]  )							->     List[str]:


          """simple docstring"""





          _SCREAMING_SNAKE_CASE			  =self.__need()
          _SCREAMING_SNAKE_CASE			  =self.__allocated_resources_table
          _SCREAMING_SNAKE_CASE			  =self.__available_resources()
          _SCREAMING_SNAKE_CASE			  =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:
              _SCREAMING_SNAKE_CASE			  =False
              for each_need in need_list:
                  _SCREAMING_SNAKE_CASE			  =True
                  for index, need in enumerate(_a  ):
                      if need > available_resources[index]:
                          _SCREAMING_SNAKE_CASE			  =False
                          break
                  if execution:
                      _SCREAMING_SNAKE_CASE			  =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:
                              _SCREAMING_SNAKE_CASE			  =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
                      _SCREAMING_SNAKE_CASE			  =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 							__UpperCamelCase				(       self					:      Any  )							->     List[Any]:


          """simple docstring"""





          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()



from collections.abc import Generator







def 						lowerCamelCase(   ):
				_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =0, 1
				while True:
								_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =b, a + b
								yield b







def 						lowerCamelCase(   a__ = 1000):
				_SCREAMING_SNAKE_CASE			  =1
				_SCREAMING_SNAKE_CASE			  =fibonacci_generator()
				while len(str(next(a__))) < n:
								answer += 1
				return answer + 1


if __name__ == "__main__":
							print(solution(int(str(input()).strip())))