

'''simple docstring'''







from collections.abc import Generator
def       UpperCAmelCase__    (      )			->			Generator[int, None, None]:
       A_					,			A_						=      0, 1
       while True:
              A_					,			A_						=      b, a + b
              yield b
def       UpperCAmelCase__    (      UpperCAmelCase__ = 10_00				)			->			int:
       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())))



'''simple docstring'''







import os

__lowerCamelCase		       =    {'''I''': 1, '''V''': 5, '''X''': 10, '''L''': 50, '''C''': 100, '''D''': 500, '''M''': 1000}
def       UpperCAmelCase__    (      UpperCAmelCase__				)			->			int:
       A_						=      0

       A_						=      0
       while index < len(UpperCAmelCase__				) - 1:
              A_						=      SYMBOLS[numerals[index]]
              A_						=      SYMBOLS[numerals[index + 1]]
              if current_value < next_value:
                     total_value -= current_value
              else:
                     total_value += current_value
              index += 1
       total_value += SYMBOLS[numerals[index]]

       return total_value
def       UpperCAmelCase__    (      UpperCAmelCase__				)			->			str:
       A_						=      """"""

       A_						=      num // 10_00
       numerals += m_count * "M"
       num %= 10_00

       A_						=      num // 1_00
       if c_count == 9:
              numerals += "CM"
              c_count -= 9
       elif c_count == 4:
              numerals += "CD"
              c_count -= 4
       if c_count >= 5:
              numerals += "D"
              c_count -= 5
       numerals += c_count * "C"
       num %= 1_00

       A_						=      num // 10
       if x_count == 9:
              numerals += "XC"
              x_count -= 9
       elif x_count == 4:
              numerals += "XL"
              x_count -= 4
       if x_count >= 5:
              numerals += "L"
              x_count -= 5
       numerals += x_count * "X"
       num %= 10

       if num == 9:
              numerals += "IX"
              num -= 9
       elif num == 4:
              numerals += "IV"
              num -= 4
       if num >= 5:
              numerals += "V"
              num -= 5
       numerals += num * "I"

       return numerals
def       UpperCAmelCase__    (      UpperCAmelCase__ = "/p089_roman.txt"				)			->			int:
       A_						=      0

       with open(os.path.dirname(UpperCAmelCase__				) + roman_numerals_filename				) as filea:
              A_						=      filea.readlines()

       for line in lines:
              A_						=      line.strip()
              A_						=      parse_roman_numerals(UpperCAmelCase__				)
              A_						=      generate_roman_numerals(UpperCAmelCase__				)
              savings += len(UpperCAmelCase__				) - len(UpperCAmelCase__				)

       return savings


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