




class 	lowerCamelCase_							:  # Public class to implement a graph


 '''simple docstring'''







 def __init__(							self  :		Optional[Any]    ,    _lowerCAmelCase  :		int    ,    _lowerCAmelCase  :		int    ,    _lowerCAmelCase  :		list[list[bool]]						):
       SCREAMING_SNAKE_CASE_     						=      row
       SCREAMING_SNAKE_CASE_     						=      col
       SCREAMING_SNAKE_CASE_     						=      graph



 def 				lowerCAmelCase_  (							self  :		Union[str, Any]    ,    _lowerCAmelCase  :		int    ,    _lowerCAmelCase  :		int    ,    _lowerCAmelCase  :		list[list[bool]]						):
       return (
           0 <= i < self.ROW
           and 0 <= j < self.COL
           and not visited[i][j]
           and self.graph[i][j]
       )



 def 				lowerCAmelCase_  (							self  :		Any    ,    _lowerCAmelCase  :		int    ,    _lowerCAmelCase  :		int    ,    _lowerCAmelCase  :		list[list[bool]]						):
       # Checking all 8 elements surrounding nth element
       SCREAMING_SNAKE_CASE_     						=      [-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
       SCREAMING_SNAKE_CASE_     						=      [-1, 0, 1, -1, 1, -1, 0, 1]
       SCREAMING_SNAKE_CASE_     						=      True  # Make those cells visited
       for k in range(8						):
             if self.is_safe(i + row_nbr[k]    ,    j + col_nbr[k]    ,    _lowerCAmelCase						):
                   self.diffs(i + row_nbr[k]    ,    j + col_nbr[k]    ,    _lowerCAmelCase						)




 def 				lowerCAmelCase_  (							self  :		Optional[int]						):  # And finally, count all islands.
       SCREAMING_SNAKE_CASE_     						=      [[False for j in range(self.COL						)] for i in range(self.ROW						)]
       SCREAMING_SNAKE_CASE_     						=      0
       for i in range(self.ROW						):
             for j in range(self.COL						):
                   if visited[i][j] is False and self.graph[i][j] == 1:
                         self.diffs(_lowerCAmelCase    ,    _lowerCAmelCase    ,    _lowerCAmelCase						)
                         count += 1
       return count





def  UpperCAmelCase_							(				) ->			int:
      return 1

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return 0 if x < 0 else two_pence(x - 2							) + one_pence()

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return 0 if x < 0 else five_pence(x - 5							) + two_pence(__UpperCAmelCase							)

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return 0 if x < 0 else ten_pence(x - 10							) + five_pence(__UpperCAmelCase							)

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return 0 if x < 0 else twenty_pence(x - 20							) + ten_pence(__UpperCAmelCase							)

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return 0 if x < 0 else fifty_pence(x - 50							) + twenty_pence(__UpperCAmelCase							)

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return 0 if x < 0 else one_pound(x - 1_00							) + fifty_pence(__UpperCAmelCase							)

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int							) ->			int:
      return 0 if x < 0 else two_pound(x - 2_00							) + one_pound(__UpperCAmelCase							)

def  UpperCAmelCase_							(				__UpperCAmelCase						:     int = 2_00							) ->			int:
      return two_pound(__UpperCAmelCase							)


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