

def 							__lowerCAmelCase     (							_UpperCamelCase		:	Any		,				_UpperCamelCase		:	Any						)		->				List[str]:
 '''simple docstring'''


 if not (isinstance(lowerCAmelCase__		,				lowerCAmelCase__						) and isinstance(lowerCAmelCase__		,				lowerCAmelCase__						)):
  raise ValueError('longest_common_substring() takes two strings for inputs'						)

 SCREAMING_SNAKE_CASE		    =      len(lowerCAmelCase__						)
 SCREAMING_SNAKE_CASE		    =      len(lowerCAmelCase__						)

 SCREAMING_SNAKE_CASE		    =      [[0] * (texta_length + 1) for _ in range(texta_length + 1						)]
 SCREAMING_SNAKE_CASE		    =      0
 SCREAMING_SNAKE_CASE		    =      0

 for i in range(1		,				texta_length + 1						):
  for j in range(1		,				texta_length + 1						):
   if texta[i - 1] == texta[j - 1]:
    SCREAMING_SNAKE_CASE		    =      1 + dp[i - 1][j - 1]
    if dp[i][j] > ans_length:
     SCREAMING_SNAKE_CASE		    =      i
     SCREAMING_SNAKE_CASE		    =      dp[i][j]

 return texta[ans_index - ans_length : ans_index]


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())))



