

def       lowercase					(	__A :					str ,    __A :					str		)				->			bool:





    '''simple docstring'''




    snake_case							:		str        =		len(__A		)
    snake_case							:		Union[str, Any]        =		len(__A		)
    snake_case							:		Union[str, Any]        =		[[False for _ in range(m + 1		)] for _ in range(n + 1		)]
    snake_case							:		List[Any]        =		True
    for i in range(__A		):
        for j in range(m + 1		):
            if dp[i][j]:
                if j < m and a[i].upper() == b[j]:
                    snake_case							:		Any        =		True
                if a[i].islower():
                    snake_case							:		Dict        =		True
    return dp[n][m]


if __name__ == "__main__":
     import doctest

     doctest.testmod()







def  a   (lowerCAmelCase__ = 1_000_000   ):
   __a					=  1
   __a					=  1
   __a					=  {1: 1}

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



