


"""simple docstring"""







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())))










"""simple docstring"""







from bisect import bisect
from itertools import accumulate


def      lowercase			(				A_  ,   A_  ,   A_  ,   A_       )->      Union[str, Any]:
  '''simple docstring'''







  a						:		Any      							=			sorted(zip(A_  ,   A_       )  ,   key=lambda A_       : x[0] / x[1]  ,   reverse=A_       )
  a							,		a						:		int      							=			[i[0] for i in r], [i[1] for i in r]
  a						:		Union[str, Any]      							=			list(accumulate(A_       )       )
  a						:		Optional[Any]      							=			bisect(A_  ,   A_       )
  return (
      0
      if k == 0
      else sum(vl[:k]       ) + (w - acc[k - 1]) * (vl[k]) / (wt[k])
      if k != n
      else sum(vl[:k]       )
  )


if __name__ == "__main__":
 import doctest

 doctest.testmod()






