


'''simple docstring'''






from math import isqrt


def    _snake_case  (	A			)		->       bool:
							return all(number % divisor != 0 for divisor in range(2					,       isqrt(A			) + 1			)			)


def    _snake_case  (	A = 10**6			)		->       int:
							lowerCAmelCase__			  =      0
							lowerCAmelCase__			  =      1
							lowerCAmelCase__			  =      7
							while prime_candidate < max_prime:
														primes_count += is_prime(A			)

														cube_index += 1
														prime_candidate += 6 * cube_index

							return primes_count


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




def  lowerCAmelCase_	(lowerCAmelCase__:		int  ):





			"""simple docstring"""


			if n == 1 or not isinstance(lowerCAmelCase__		,						lowerCAmelCase__  ):
						return 0
			elif n == 2:
						return 1
			else:
						UpperCAmelCase_:		Optional[int]							      =     [0, 1]
						for i in range(2		,						n + 1  ):
									sequence.append(sequence[i - 1] + sequence[i - 2]  )

						return sequence[n]







def  lowerCAmelCase_	(lowerCAmelCase__:		int  ):





			"""simple docstring"""


			UpperCAmelCase_:		str							      =     0
			UpperCAmelCase_:		str							      =     2

			while digits < n:
						index += 1
						UpperCAmelCase_:		Union[str, Any]							      =     len(str(fibonacci(lowerCAmelCase__  )  )  )

			return index







def  lowerCAmelCase_	(lowerCAmelCase__:		int = 1_0_0_0  ):





			"""simple docstring"""


			return fibonacci_digits_index(lowerCAmelCase__  )


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






