






def   __lowercase       (			snake_case = 1_0_0_0_0_0_0			):







				"""simple docstring"""






				__magic_name__		:Dict   =   1
				__magic_name__		:Tuple   =   1
				__magic_name__		:Any   =   {1: 1}

				for inputa in range(2,	snake_case			):
								__magic_name__		:Dict   =   0
								__magic_name__		:Optional[Any]   =   inputa

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

								if inputa not in counters:
												__magic_name__		:int   =   counter

								if counter > pre_counter:
												__magic_name__		:List[Any]   =   inputa
												__magic_name__		:Dict   =   counter
				return largest_number


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










import numpy as np
def 							UpperCamelCase_(					_A :np.array	)->		np.array:
			return 1 / (1 + np.exp(-vector	))


if __name__ == "__main__":
						import doctest

						doctest.testmod()


