
def 						lowercase_      (       )							->							int:
    """simple docstring"""

    return 1



def 						lowercase_      (       A__		)							->							int:
    """simple docstring"""

    return 0 if x < 0 else two_pence(x - 2		) + one_pence()



def 						lowercase_      (       A__		)							->							int:
    """simple docstring"""

    return 0 if x < 0 else five_pence(x - 5		) + two_pence(A__		)



def 						lowercase_      (       A__		)							->							int:
    """simple docstring"""

    return 0 if x < 0 else ten_pence(x - 10		) + five_pence(A__		)



def 						lowercase_      (       A__		)							->							int:
    """simple docstring"""

    return 0 if x < 0 else twenty_pence(x - 20		) + ten_pence(A__		)



def 						lowercase_      (       A__		)							->							int:
    """simple docstring"""

    return 0 if x < 0 else fifty_pence(x - 50		) + twenty_pence(A__		)



def 						lowercase_      (       A__		)							->							int:
    """simple docstring"""

    return 0 if x < 0 else one_pound(x - 100		) + fifty_pence(A__		)



def 						lowercase_      (       A__		)							->							int:
    """simple docstring"""

    return 0 if x < 0 else two_pound(x - 200		) + one_pound(A__		)



def 						lowercase_      (       A__ = 200		)							->							int:
    """simple docstring"""

    return two_pound(A__		)


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



from __future__ import annotations



def 						lowercase_      (       A__			,		A__			,		A__		)							->							int | float:
    """simple docstring"""

    if len(A__		) == 0:
        raise ValueError("find_max() arg is an empty sequence"		)
    if (
        left >= len(A__		)
        or left < -len(A__		)
        or right >= len(A__		)
        or right < -len(A__		)
    ):
        raise IndexError("list index out of range"		)
    if left == right:
        return nums[left]
    snake_case								= (left + right) >> 1  # the middle
    snake_case								= find_max(A__			,		A__			,		A__		)  # find max in range[left, mid]
    snake_case								= find_max(A__			,		mid + 1			,		A__		)  # find max in range[mid + 1, right]

    return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
   import doctest

   doctest.testmod(verbose=True)

