
from __future__ import annotations

__lowerCAmelCase      :					int   	=       {1: 1}

def a__   (	A_ ):






  '''simple docstring'''





  if n in COLLATZ_SEQUENCE_LENGTHS:
    return COLLATZ_SEQUENCE_LENGTHS[n]
  __magic_name__    					=	n // 2 if n % 2 == 0 else 3 * n + 1
  __magic_name__    					=	collatz_sequence_length(A_ ) + 1
  __magic_name__    					=	sequence_length
  return sequence_length

def a__   (	A_ = 1000000 ):






  '''simple docstring'''





  __magic_name__    					=	max((collatz_sequence_length(A_ ), i) for i in range(1,					A_ ) )
  return result[1]


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



class 	UpperCAmelCase_      :


  '''simple docstring'''







  def __init__(			self      :			Tuple      ,							UpperCamelCase__      :			Dict=None   )      ->     List[str]:







    """simple docstring"""






    __magic_name__    					=	data
    __magic_name__    					=	None





  def __repr__(			self      :			Optional[int]   )      ->     Optional[int]:







    """simple docstring"""






    __magic_name__    					=	""""""
    __magic_name__    					=	self
    while temp:
      string_rep += F'''<{temp.data}> ---> '''
      __magic_name__    					=	temp.next
    string_rep += "<END>"
    return string_rep







def a__   (	A_ ):






  '''simple docstring'''





  if not elements_list:
    raise Exception("""The Elements List is empty""" )

  # Set first element as Head
  __magic_name__    					=	Node(elements_list[0] )
  __magic_name__    					=	head
  # Loop through elements from position 1
  for data in elements_list[1:]:
    __magic_name__    					=	Node(A_ )
    __magic_name__    					=	current.next
  return head


__lowerCAmelCase      :					Union[str, Any]   	=       [1, 3, 5, 32, 44, 12, 43]
print(F'''List: {list_data}''')
print('Creating Linked List from List.')
__lowerCAmelCase      :					Optional[Any]   	=       make_linked_list(list_data)
print('Linked List:')





print(linked_list)

