


'''simple docstring'''







from random import randint
from tempfile import TemporaryFile

import numpy as np




def        __lowercase						(      __SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE		)				->					Any:
     """simple docstring"""




     __a       =   0
     if start < end:
          __a       =   randint(__SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE		)
          __a       =   a[end]
          __a       =   a[pivot]
          __a       =   temp

          __a ,						__a       =   _in_place_partition(__SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE		)
          count += _in_place_quick_sort(__SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE				,  p - 1		)
          count += _in_place_quick_sort(__SCREAMING_SNAKE_CASE				,  p + 1				,  __SCREAMING_SNAKE_CASE		)
     return count




def        __lowercase						(      __SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE		)				->					Dict:
     """simple docstring"""




     __a       =   0
     __a       =   randint(__SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE		)
     __a       =   a[end]
     __a       =   a[pivot]
     __a       =   temp
     __a       =   start - 1
     for index in range(__SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE		):
          count += 1
          if a[index] < a[end]:  # check if current val is less than pivot value
               __a       =   new_pivot_index + 1
               __a       =   a[new_pivot_index]
               __a       =   a[index]
               __a       =   temp

     __a       =   a[new_pivot_index + 1]
     __a       =   a[end]
     __a       =   temp
     return new_pivot_index + 1, count


SCREAMING_SNAKE_CASE_      =			TemporaryFile()
SCREAMING_SNAKE_CASE_      =			1_00  # 1000 elements are to be sorted


SCREAMING_SNAKE_CASE_      ,     SCREAMING_SNAKE_CASE_      =			0, 1  # mean and standard deviation
SCREAMING_SNAKE_CASE_      =			np.random.normal(mu, sigma, p)
np.save(outfile, X)
print('The array is')
print(X)


outfile.seek(0)  # using the same array
SCREAMING_SNAKE_CASE_      =			np.load(outfile)
SCREAMING_SNAKE_CASE_      =			len(M) - 1
SCREAMING_SNAKE_CASE_      =			_in_place_quick_sort(M, 0, r)

print(
    'No of Comparisons for 100 elements selected from a standard normal distribution'
    'is :'
)



print(z)










'''simple docstring'''







def        __lowercase						(      __SCREAMING_SNAKE_CASE = 100_0000		)				->					int:
     """simple docstring"""




     __a       =   1
     __a       =   1
     __a       =   {1: 1}

     for inputa in range(2				,  __SCREAMING_SNAKE_CASE		):
          __a       =   0
          __a       =   inputa

          while True:
               if number in counters:
                    counter += counters[number]
                    break
               if number % 2 == 0:
                    number //= 2
                    counter += 1
               else:
                    __a       =   (3 * number) + 1
                    counter += 1

          if inputa not in counters:
               __a       =   counter

          if counter > pre_counter:
               __a       =   inputa
               __a       =   counter
     return largest_number


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






