




'''simple docstring'''






from collections import deque




class 		a__    :





							'''simple docstring'''






							def __init__(		self ,   lowerCamelCase_ ,   lowerCamelCase_ ,   lowerCamelCase_       )	->							None:
														lowerCAmelCase__	       =     process_name  # process name
														lowerCAmelCase__	       =     arrival_time  # arrival time of the process
														# completion time of finished process or last interrupted time
														lowerCAmelCase__	       =     arrival_time
														lowerCAmelCase__	       =     burst_time  # remaining burst time
														lowerCAmelCase__	       =     0  # total time of the process wait in ready queue
														lowerCAmelCase__	       =     0  # time from arrival time to completion time




class 		a__    :





							'''simple docstring'''






							def __init__(		self ,   lowerCamelCase_ ,   lowerCamelCase_ ,   lowerCamelCase_ ,   lowerCamelCase_ ,   )	->							None:
														# total number of mlfq's queues
														lowerCAmelCase__	       =     number_of_queues
														# time slice of queues that round robin algorithm applied
														lowerCAmelCase__	       =     time_slices
														# unfinished process is in this ready_queue
														lowerCAmelCase__	       =     queue
														# current time
														lowerCAmelCase__	       =     current_time
														# finished process is in this sequence queue
														lowerCAmelCase__	       =     deque()







							def   __SCREAMING_SNAKE_CASE							(		self       )	->							list[str]:
														lowerCAmelCase__	       =     []
														for i in range(len(self.finish_queue       )       ):
																					sequence.append(self.finish_queue[i].process_name       )
														return sequence







							def   __SCREAMING_SNAKE_CASE							(		self ,   lowerCamelCase_       )	->							list[int]:
														lowerCAmelCase__	       =     []
														for i in range(len(lowerCAmelCase__       )       ):
																					waiting_times.append(queue[i].waiting_time       )
														return waiting_times







							def   __SCREAMING_SNAKE_CASE							(		self ,   lowerCamelCase_       )	->							list[int]:
														lowerCAmelCase__	       =     []
														for i in range(len(lowerCAmelCase__       )       ):
																					turnaround_times.append(queue[i].turnaround_time       )
														return turnaround_times







							def   __SCREAMING_SNAKE_CASE							(		self ,   lowerCamelCase_       )	->							list[int]:
														lowerCAmelCase__	       =     []
														for i in range(len(lowerCAmelCase__       )       ):
																					completion_times.append(queue[i].stop_time       )
														return completion_times







							def   __SCREAMING_SNAKE_CASE							(		self ,   lowerCamelCase_       )	->							list[int]:
														return [q.burst_time for q in queue]







							def   __SCREAMING_SNAKE_CASE							(		self ,   lowerCamelCase_       )	->							int:
														process.waiting_time += self.current_time - process.stop_time
														return process.waiting_time







							def   __SCREAMING_SNAKE_CASE							(		self ,   lowerCamelCase_       )	->							deque[Process]:
														lowerCAmelCase__	       =     deque()  # sequence deque of finished process
														while len(lowerCAmelCase__       ) != 0:
																					lowerCAmelCase__	       =     ready_queue.popleft()  # current process

																					# if process's arrival time is later than current time, update current time
																					if self.current_time < cp.arrival_time:
																												self.current_time += cp.arrival_time

																					# update waiting time of current process
																					self.update_waiting_time(lowerCAmelCase__       )
																					# update current time
																					self.current_time += cp.burst_time
																					# finish the process and set the process's burst-time 0
																					lowerCAmelCase__	       =     0
																					# set the process's turnaround time because it is finished
																					lowerCAmelCase__	       =     self.current_time - cp.arrival_time
																					# set the completion time
																					lowerCAmelCase__	       =     self.current_time
																					# add the process to queue that has finished queue
																					finished.append(lowerCAmelCase__       )

														self.finish_queue.extend(lowerCAmelCase__       )  # add finished process to finish queue
														# FCFS will finish all remaining processes
														return finished







							def   __SCREAMING_SNAKE_CASE							(		self ,   lowerCamelCase_ ,   lowerCamelCase_       )	->							tuple[deque[Process], deque[Process]]:
														lowerCAmelCase__	       =     deque()  # sequence deque of terminated process
														# just for 1 cycle and unfinished processes will go back to queue
														for _ in range(len(lowerCAmelCase__       )       ):
																					lowerCAmelCase__	       =     ready_queue.popleft()  # current process

																					# if process's arrival time is later than current time, update current time
																					if self.current_time < cp.arrival_time:
																												self.current_time += cp.arrival_time

																					# update waiting time of unfinished processes
																					self.update_waiting_time(lowerCAmelCase__       )
																					# if the burst time of process is bigger than time-slice
																					if cp.burst_time > time_slice:
																												# use CPU for only time-slice
																												self.current_time += time_slice
																												# update remaining burst time
																												cp.burst_time -= time_slice
																												# update end point time
																												lowerCAmelCase__	       =     self.current_time
																												# locate the process behind the queue because it is not finished
																												ready_queue.append(lowerCAmelCase__       )
																					else:
																												# use CPU for remaining burst time
																												self.current_time += cp.burst_time
																												# set burst time 0 because the process is finished
																												lowerCAmelCase__	       =     0
																												# set the finish time
																												lowerCAmelCase__	       =     self.current_time
																												# update the process' turnaround time because it is finished
																												lowerCAmelCase__	       =     self.current_time - cp.arrival_time
																												# add the process to queue that has finished queue
																												finished.append(lowerCAmelCase__       )

														self.finish_queue.extend(lowerCAmelCase__       )  # add finished process to finish queue
														# return finished processes queue and remaining processes queue
														return finished, ready_queue







							def   __SCREAMING_SNAKE_CASE							(		self       )	->							deque[Process]:

														#  all queues except last one have round_robin algorithm
														for i in range(self.number_of_queues - 1       ):
																					lowerCAmelCase__	       =     self.round_robin(
																					    self.ready_queue ,   self.time_slices[i]       )
														#  the last queue has first_come_first_served algorithm
														self.first_come_first_served(self.ready_queue       )

														return self.finish_queue


if __name__ == "__main__":
		import doctest

		__UpperCAmelCase       =							Process('''P1''', 0, 53)
		__UpperCAmelCase       =							Process('''P2''', 0, 17)
		__UpperCAmelCase       =							Process('''P3''', 0, 68)
		__UpperCAmelCase       =							Process('''P4''', 0, 24)
		__UpperCAmelCase       =							3
		__UpperCAmelCase       =							[17, 25]
		__UpperCAmelCase       =							deque([Pa, Pa, Pa, Pa])

		if len(time_slices) != number_of_queues - 1:
				raise SystemExit(0)

		doctest.testmod(extraglobs={'''queue''': deque([Pa, Pa, Pa, Pa])})

		__UpperCAmelCase       =							Process('''P1''', 0, 53)
		__UpperCAmelCase       =							Process('''P2''', 0, 17)
		__UpperCAmelCase       =							Process('''P3''', 0, 68)
		__UpperCAmelCase       =							Process('''P4''', 0, 24)
		__UpperCAmelCase       =							3
		__UpperCAmelCase       =							[17, 25]
		__UpperCAmelCase       =							deque([Pa, Pa, Pa, Pa])
		__UpperCAmelCase       =							MLFQ(number_of_queues, time_slices, queue, 0)
		__UpperCAmelCase       =							mlfq.multi_level_feedback_queue()

		# print total waiting times of processes(P1, P2, P3, P4)
		print(
		    f"""waiting time:\
        \t\t\t{MLFQ.calculate_waiting_time(mlfq, [Pa, Pa, Pa, Pa])}"""
		)
		# print completion times of processes(P1, P2, P3, P4)
		print(
		    f"""completion time:\
        \t\t{MLFQ.calculate_completion_time(mlfq, [Pa, Pa, Pa, Pa])}"""
		)
		# print total turnaround times of processes(P1, P2, P3, P4)
		print(
		    f"""turnaround time:\
        \t\t{MLFQ.calculate_turnaround_time(mlfq, [Pa, Pa, Pa, Pa])}"""
		)
		# print sequence of finished processes
		print(
		    f"""sequence of finished processes:\
        {mlfq.calculate_sequence_of_finish_queue()}"""
		)



'''simple docstring'''






def  _snake_case       (					A = 10	)						->   str:
							if not isinstance(A			,   A	) or n < 0:
														raise ValueError('''Invalid input'''	)
							lowerCAmelCase__	       =     10**n
							lowerCAmelCase__	       =     28433 * (pow(2			,   7830457			,   A	)) + 1
							return str(number % modulus	)


if __name__ == "__main__":
		from doctest import testmod

		testmod()
		print(f"""{solution(10) = }""")