





'''simple docstring'''






from collections.abc import Generator
def   UpperCamelCase__ (						):





      """simple docstring"""


      _lowerCAmelCase	,				_lowerCAmelCase					=				0, 1
      while True:
            _lowerCAmelCase	,				_lowerCAmelCase					=				b, a + b
            yield b
def   UpperCamelCase__ (						lowerCAmelCase = 10_00    ):





      """simple docstring"""


      _lowerCAmelCase					=				1
      _lowerCAmelCase					=				fibonacci_generator()
      while len(str(next(lowerCAmelCase    )    )    ) < n:
            answer += 1
      return answer + 1


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













'''simple docstring'''






class 					UpperCAmelCase	:




      def __init__(     self     :					List[str]     ,     __snake_case     :					str    )							-> Union[str, Any]:
            _lowerCAmelCase					=				val
            _lowerCAmelCase					=				None
            _lowerCAmelCase					=				None




      def 							lowercase__       (     self     :					Optional[Any]     ,     __snake_case     :					int    )							-> Optional[int]:
            if self.val:
                  if val < self.val:
                        if self.left is None:
                              _lowerCAmelCase					=				Node(__snake_case    )
                        else:
                              self.left.insert(__snake_case    )
                  elif val > self.val:
                        if self.right is None:
                              _lowerCAmelCase					=				Node(__snake_case    )
                        else:
                              self.right.insert(__snake_case    )
            else:
                  _lowerCAmelCase					=				val




def   UpperCamelCase__ (						lowerCAmelCase				,      lowerCAmelCase    ):





      """simple docstring"""


      if root:
            inorder(root.left				,      lowerCAmelCase    )
            res.append(root.val    )
            inorder(root.right				,      lowerCAmelCase    )
def   UpperCamelCase__ (						lowerCAmelCase    ):





      """simple docstring"""


      if len(lowerCAmelCase    ) == 0:
            return arr
      _lowerCAmelCase					=				Node(arr[0]    )
      for i in range(1				,      len(lowerCAmelCase    )    ):
            root.insert(arr[i]    )
      # Traverse BST in order.
      _lowerCAmelCase					=				[]
      inorder(lowerCAmelCase				,      lowerCAmelCase    )
      return res


if __name__ == "__main__":
      print(tree_sort([10, 1, 3, 2, 9, 14, 13]))






