




'''simple docstring'''


def  SCREAMING_SNAKE_CASE(					)       ->      int:
     return 1
def  SCREAMING_SNAKE_CASE(					__lowercase     )       ->      int:
     return 0 if x < 0 else two_pence(x - 2     ) + one_pence()
def  SCREAMING_SNAKE_CASE(					__lowercase     )       ->      int:
     return 0 if x < 0 else five_pence(x - 5     ) + two_pence(UpperCamelCase__     )
def  SCREAMING_SNAKE_CASE(					__lowercase     )       ->      int:
     return 0 if x < 0 else ten_pence(x - 1_0     ) + five_pence(UpperCamelCase__     )
def  SCREAMING_SNAKE_CASE(					__lowercase     )       ->      int:
     return 0 if x < 0 else twenty_pence(x - 2_0     ) + ten_pence(UpperCamelCase__     )
def  SCREAMING_SNAKE_CASE(					__lowercase     )       ->      int:
     return 0 if x < 0 else fifty_pence(x - 5_0     ) + twenty_pence(UpperCamelCase__     )
def  SCREAMING_SNAKE_CASE(					__lowercase     )       ->      int:
     return 0 if x < 0 else one_pound(x - 1_0_0     ) + fifty_pence(UpperCamelCase__     )
def  SCREAMING_SNAKE_CASE(					__lowercase     )       ->      int:
     return 0 if x < 0 else two_pound(x - 2_0_0     ) + one_pound(UpperCamelCase__     )
def  SCREAMING_SNAKE_CASE(					__lowercase = 2_0_0     )       ->      int:
     return two_pound(UpperCamelCase__     )


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













import random


def 	UpperCamelCase__(       UpperCamelCase__			:       list ,     UpperCamelCase__			:       List[Any]  )->tuple:
       A__					,	A__					,	A__											=						[], [], []
       for element in data:
              if element < pivot:
                     less.append(UpperCamelCase__  )
              elif element > pivot:
                     greater.append(UpperCamelCase__  )
              else:
                     equal.append(UpperCamelCase__  )
       return less, equal, greater


def 	UpperCamelCase__(       UpperCamelCase__			:       list ,     UpperCamelCase__			:       int  )->Optional[int]:
       # index = len(items) // 2 when trying to find the median
       #   (value of index when items is sorted)

       # invalid input
       if index >= len(UpperCamelCase__  ) or index < 0:
              return None

       A__											=						items[random.randint(0 ,     len(UpperCamelCase__  ) - 1  )]
       A__											=						0
       A__					,	A__					,	A__											=						_partition(UpperCamelCase__ ,     UpperCamelCase__  )
       A__											=						len(UpperCamelCase__  )
       A__											=						len(UpperCamelCase__  )

       # index is the pivot
       if m <= index < m + count:
              return pivot
       # must be in smaller
       elif m > index:
              return quick_select(UpperCamelCase__ ,     UpperCamelCase__  )
       # must be in larger
       else:
              return quick_select(UpperCamelCase__ ,     index - (m + count)  )





