






def      __A					(     _lowercase = 1_00_00_00 ):

					'''simple docstring'''







					_A								= 1
					_A								= 1
					_A								= {1: 1}

					for inputa in range(2					,			_lowercase ):
										_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())))











__A      =				{0: [2, 3], 1: [0], 2: [1], 3: [4], 4: []}

__A      =				{0: [1, 2, 3], 1: [2], 2: [0], 3: [4], 4: [5], 5: [3]}




def      __A					(     _lowercase					,			_lowercase					,			_lowercase ):

					'''simple docstring'''







					_A								= True
					_A								= []

					for neighbour in graph[vert]:
										if not visited[neighbour]:
															order += topology_sort(_lowercase					,			_lowercase					,			_lowercase )

					order.append(_lowercase )

					return order




def      __A					(     _lowercase					,			_lowercase					,			_lowercase ):

					'''simple docstring'''







					_A								= True
					_A								= [vert]

					for neighbour in reversed_graph[vert]:
										if not visited[neighbour]:
															component += find_components(_lowercase					,			_lowercase					,			_lowercase )

					return component




def      __A					(     _lowercase ):

					'''simple docstring'''







					_A								= len(_lowercase ) * [False]
					_A								= {vert: [] for vert in range(len(_lowercase ) )}

					for vert, neighbours in graph.items():
										for neighbour in neighbours:
															reversed_graph[neighbour].append(_lowercase )

					_A								= []
					for i, was_visited in enumerate(_lowercase ):
										if not was_visited:
															order += topology_sort(_lowercase					,			_lowercase					,			_lowercase )

					_A								= []
					_A								= len(_lowercase ) * [False]

					for i in range(len(_lowercase ) ):
										_A								= order[len(_lowercase ) - i - 1]
										if not visited[vert]:
															_A								= find_components(_lowercase					,			_lowercase					,			_lowercase )
															components_list.append(_lowercase )

					return components_list



