




"""simple docstring"""

def      UpperCamelCase__   (						lowercase__     :   int = 1000      ):
		snake_case	, snake_case						:  Tuple    	= 1, 1
		snake_case						:  Optional[int]    	= 2
		while True:
				snake_case						:  Optional[int]    	= 0
				snake_case						:  List[Any]    	= fa + fa
				snake_case	, snake_case						:  str    	= fa, f
				index += 1
				for _ in str(lowercase__      ):
						i += 1
				if i == n:
						break
		return index


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





'''simple docstring'''




from __future__ import annotations

from statistics import mean





def 	a_					( lowerCamelCase	:     list[int]	, lowerCamelCase	:     list[int]	, lowerCamelCase	:     int				):
   lowerCAmelCase     =			[0] * no_of_processes
   lowerCAmelCase     =			[0] * no_of_processes

   # Initialize remaining_time to waiting_time.

   for i in range(lowerCamelCase				):
      lowerCAmelCase     =			burst_time[i]
   lowerCAmelCase     =			[]

   lowerCAmelCase     =			0
   lowerCAmelCase     =			0

   # When processes are not completed,
   # A process whose arrival time has passed \
   # and has remaining execution time is put into the ready_process.
   # The shortest process in the ready_process, target_process is executed.

   while completed != no_of_processes:
      lowerCAmelCase     =			[]
      lowerCAmelCase     =			-1

      for i in range(lowerCamelCase				):
         if (arrival_time[i] <= total_time) and (remaining_time[i] > 0):
            ready_process.append(lowerCamelCase				)

      if len(lowerCamelCase				) > 0:
         lowerCAmelCase     =			ready_process[0]
         for i in ready_process:
            if remaining_time[i] < remaining_time[target_process]:
               lowerCAmelCase     =			i
         total_time += burst_time[target_process]
         completed += 1
         lowerCAmelCase     =			0
         lowerCAmelCase     =			(
             total_time - arrival_time[target_process] - burst_time[target_process]
         )
      else:
         total_time += 1

   return waiting_time





def 	a_					( lowerCamelCase	:     list[int]	, lowerCamelCase	:     int	, lowerCamelCase	:     list[int]				):
   lowerCAmelCase     =			[0] * no_of_processes
   for i in range(lowerCamelCase				):
      lowerCAmelCase     =			burst_time[i] + waiting_time[i]
   return turn_around_time


if __name__ == "__main__":
       print("""[TEST CASE 01]""")

       __snake_case    						=4
       __snake_case    						=[2, 5, 3, 7]
       __snake_case    						=[0, 0, 0, 0]
       __snake_case    						=calculate_waitingtime(arrival_time, burst_time, no_of_processes)
       __snake_case    						=calculate_turnaroundtime(
           burst_time, no_of_processes, waiting_time
       )

       # Printing the Result
       print("""PID\tBurst Time\tArrival Time\tWaiting Time\tTurnaround Time""")
       for i, process_id in enumerate(list(range(1, 5))):
              print(
                  F'''{process_id}\t{burst_time[i]}\t\t\t{arrival_time[i]}\t\t\t\t'''
                  F'''{waiting_time[i]}\t\t\t\t{turn_around_time[i]}'''
              )
       print(F'''\nAverage waiting time = {mean(waiting_time):.5f}''')
       print(F'''Average turnaround time = {mean(turn_around_time):.5f}''')





