


def     UpperCamelCase    (      _a = 1_0_0_0		)					->							Dict:
     '''simple docstring'''





     lowercase_       :List[Any]     =       1, 1
     lowercase_       :Optional[Any]     =       2
     while True:
          lowercase_       :str     =       0
          lowercase_       :List[str]     =       fa + fa
          lowercase_       :Optional[Any]     =       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())))





from __future__ import annotations




def     UpperCamelCase    (      _a       ,		_a = None       ,		_a = None		)					->							None:
     '''simple docstring'''





     if start is None:
          lowercase_       :str     =       0

     if end is None:
          lowercase_       :str     =       len(_a		) - 1

     if start >= end:
          return

     lowercase_       :Dict     =       (start + end) // 2

     slowsort(_a       ,		_a       ,		_a		)
     slowsort(_a       ,		mid + 1       ,		_a		)

     if sequence[end] < sequence[mid]:
          lowercase_    ,      lowercase_       :List[Any]     =       sequence[mid], sequence[end]

     slowsort(_a       ,		_a       ,		end - 1		)


if __name__ == "__main__":
   from doctest import testmod

   testmod()

