




'''simple docstring'''







from __future__ import annotations

_lowerCamelCase							:						Union[str, Any]								=  {1: 1}






def 		_lowercase		(	lowercase_  ):



		'''simple docstring'''







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






def 		_lowercase		(	lowercase_ = 1000000  ):



		'''simple docstring'''







		_snake_case	       =       max((collatz_sequence_length(lowercase_  ), i) for i in range(1						,							lowercase_  )  )
		return result[1]


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











'''simple docstring'''







from __future__ import annotations

import math
from itertools import permutations






def 		_lowercase		(	lowercase_  ):



		'''simple docstring'''







		if 1 < number < 4:
				# 2 and 3 are primes
				return True
		elif number < 2 or number % 2 == 0 or number % 3 == 0:
				# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
				return False

		# All primes number are in format of 6k +/- 1
		for i in range(5						,							int(math.sqrt(lowercase_  ) + 1  )						,							6  ):
				if number % i == 0 or number % (i + 2) == 0:
						return False
		return True






def 		_lowercase		(	lowercase_ = 7  ):



		'''simple docstring'''







		_snake_case	       =       "".join(str(lowercase_  ) for i in range(1						,							n + 1  )  )
		_snake_case	       =       [int("".join(lowercase_  )  ) for i in permutations(lowercase_						,							lowercase_  )]
		_snake_case	       =       [num for num in perm_list if is_prime(lowercase_  )]
		return max(lowercase_  ) if pandigitals else 0


if __name__ == "__main__":
						print(F'''{solution() = }''')





