"""simple docstring"""




def 							SCREAMING_SNAKE_CASE     (			_lowerCamelCase						:       int = 1000000	)       ->      int:
  _lowerCAmelCase						:       str  			=     1
  _lowerCAmelCase						:       str  			=     1
  _lowerCAmelCase						:       List[str]  			=     {1: 1}

  for inputa in range(2			,_lowerCamelCase	):
    _lowerCAmelCase						:       str  			=     0
    _lowerCAmelCase						:       int  			=     inputa

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

    if inputa not in counters:
      _lowerCAmelCase						:       Union[str, Any]  			=     counter

    if counter > pre_counter:
      _lowerCAmelCase						:       List[str]  			=     inputa
      _lowerCAmelCase						:       str  			=     counter
  return largest_number


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











from math import factorial




def 		lowerCAmelCase_    (  __UpperCAmelCase:			int		,   __UpperCAmelCase:			int      )      ->	int:

    # If either of the conditions are true, the function is being asked
    # to calculate a factorial of a negative number, which is not possible
    if n < k or k < 0:
        raise ValueError('''Please enter positive integers for n and k where n >= k'''      )
    return factorial(__UpperCAmelCase      ) // (factorial(__UpperCAmelCase      ) * factorial(n - k      ))


if __name__ == "__main__":
  print(
      'The number of five-card hands possible from a standard',
      F'''fifty-two card deck is: {combinations(52, 5)}\n''',
  )

  print(
      'If a class of 40 students must be arranged into groups of',
      F'''4 for group projects, there are {combinations(40, 4)} ways''',
      'to arrange them.\n',
  )

  print(
      'If 10 teams are competing in a Formula One race, there',
      F'''are {combinations(10, 3)} ways that first, second and''',
      'third place can be awarded.',
  )

