
'''simple docstring'''
from collections.abc import Generator







def 		A_(     ):
							UpperCamelCase			,	UpperCamelCase   			=     0, 1
							while True:
														UpperCamelCase			,	UpperCamelCase   			=     b, a + b
														yield b







def 		A_(     A						:		int = 1000):
							UpperCamelCase   			=     1
							UpperCamelCase   			=     fibonacci_generator()
							while len(str(next(A))) < n:
														answer += 1
							return answer + 1


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









def 	_lowerCAmelCase (    A__ = 50_000_000						):
      lowercase__  =	set()
      lowercase__  =	int((limit - 24) ** (1 / 2)						)

      lowercase__  =	set(range(3    ,	prime_square_limit + 1    ,	2						)						)
      primes.add(2						)
      for p in range(3    ,	prime_square_limit + 1    ,	2						):
            if p not in primes:
                  continue
            primes.difference_update(set(range(p * p    ,	prime_square_limit + 1    ,	A__						)						)						)

      for primea in primes:
            lowercase__  =	primea * primea
            for primea in primes:
                  lowercase__  =	primea * primea * primea
                  if square + cube >= limit - 16:
                        break
                  for primea in primes:
                        lowercase__  =	primea * primea * primea * primea
                        lowercase__  =	square + cube + tetr
                        if total >= limit:
                              break
                        ret.add(A__						)

      return len(A__						)


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