



from collections.abc import Generator






def     __a					(		):
 a__							,			a__												= 0, 1
 while True:
  a__							,			a__												= b, a + b
  yield b






def     __a					(		__UpperCAmelCase = 1000       ):
 a__												= 1
 a__												= fibonacci_generator()
 while len(str(next(__UpperCAmelCase       )       )       ) < n:
  answer += 1
 return answer + 1


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










a_      :      str    =     6_55_21






def     __a					(		__UpperCAmelCase       ):
 a__												= 1
 a__												= 0
 for plain_chr in plain_text:
  a__												= (a + ord(__UpperCAmelCase       )) % MOD_ADLER
  a__												= (b + a) % MOD_ADLER
 return (b << 16) | a





