


"""simple docstring"""






def       A_   (   _lowerCAmelCase     :					Any       ):






     """simple docstring"""

     return [
         {
             0: [1, 2],
             1: [0, 2],
             2: [0, 1, 3, 5],
             3: [2, 4],
             4: [3],
             5: [2, 6, 8],
             6: [5, 7],
             7: [6, 8],
             8: [5, 7],
         },
         {
             0: [6],
             1: [9],
             2: [4, 5],
             3: [4],
             4: [2, 3],
             5: [2],
             6: [0, 7],
             7: [6],
             8: [],
             9: [1],
         },
         {
             0: [4],
             1: [6],
             2: [],
             3: [5, 6, 7],
             4: [0, 6],
             5: [3, 8, 9],
             6: [1, 3, 4, 7],
             7: [3, 6, 8, 9],
             8: [5, 7],
             9: [5, 7],
         },
         {
             0: [1, 3],
             1: [0, 2, 4],
             2: [1, 3, 4],
             3: [0, 2, 4],
             4: [1, 2, 3],
         },
     ][index]
def       A_   (   _lowerCAmelCase     :					dict[int, list[int]]       ):






     """simple docstring"""

     _a    	=				0
     _a    	=				len(_lowerCAmelCase       )  # No of vertices in graph
     _a    	=				[0] * n
     _a    	=				[False] * n

     def dfs(_lowerCAmelCase     :					List[Any],     _lowerCAmelCase     :					Union[str, Any],     _lowerCAmelCase     :					Union[str, Any],     _lowerCAmelCase     :					Any       ):
          _a    	=				True
          _a    	=				id_
          id_ += 1
          for to in graph[at]:
               if to == parent:
                    pass
               elif not visited[to]:
                    dfs(_lowerCAmelCase,     _lowerCAmelCase,     _lowerCAmelCase,     id_       )
                    _a    	=				min(low[at],     low[to]       )
                    if id_ <= low[to]:
                         bridges.append((at, to) if at < to else (to, at)       )
               else:
                    # This edge is a back edge and cannot be a bridge
                    _a    	=				min(low[at],     low[to]       )

     _a    	=				[]
     for i in range(_lowerCAmelCase       ):
          if not visited[i]:
               dfs(_lowerCAmelCase,     -1,     _lowerCAmelCase,     id_       )
     return bridges


if __name__ == "__main__":
   import doctest

   doctest.testmod()



"""simple docstring"""






def       A_   (   _lowerCAmelCase     :					int = 10_00       ):






     """simple docstring"""

     _a	,      _a    	=				1, 1
     _a    	=				2
     while True:
          _a    	=				0
          _a    	=				fa + fa
          _a	,      _a    	=				fa, f
          index += 1
          for _ in str(_lowerCAmelCase       ):
               i += 1
          if i == n:
               break
     return index


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