






from collections.abc import Generator
def 		_a       ( )				->     Union[str, Any]:
 a    ,	a						    = 0, 1
 while True:
  a    ,	a						    = b, a + b
  yield b
def 		_a       ( a					:List[str] = 1_000					)				->     Any:
 a						    = 1
 a						    = fibonacci_generator()
 while len(str(next(_A					)					)					) < n:
  answer += 1
 return answer + 1


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








def 		lowerCamelCase__       (						):







	'''simple docstring'''





	for n in range(1	,      1000000				):
		yield n * (n + 1) // 2


def 		lowerCamelCase__       (						_A				):







	'''simple docstring'''





	snake_case_						       =	1
	snake_case_						       =	2
	while i * i <= n:
		snake_case_						       =	0
		while n % i == 0:
			n //= i
			multiplicity += 1
		divisors_count *= multiplicity + 1
		i += 1
	if n > 1:
		divisors_count *= 2
	return divisors_count


def 		lowerCamelCase__       (						):







	'''simple docstring'''





	return next(i for i in triangle_number_generator() if count_divisors(_A				) > 500				)


if __name__ == "__main__":
		print(solution())
