






def 	__lowerCamelCase      (		)							->  int:






						"""simple docstring"""





						return 1

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





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

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





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

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





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

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





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

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





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

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





						return 0 if x < 0 else one_pound(x - 1_00		) + fifty_pence(snake_case__		)

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





						return 0 if x < 0 else two_pound(x - 2_00		) + one_pound(snake_case__		)

def 	__lowerCamelCase      (		snake_case__ = 2_00		)							->  int:






						"""simple docstring"""





						return two_pound(snake_case__		)


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









UpperCamelCase			    =     {0: [2, 3], 1: [0], 2: [1], 3: [4], 4: []}

UpperCamelCase			    =     {0: [1, 2, 3], 1: [2], 2: [0], 3: [4], 4: [5], 5: [3]}

def 	__lowerCamelCase      (		snake_case__	,snake_case__	,snake_case__		)							->  list[int]:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE     				=  True
						_SCREAMING_SNAKE_CASE     				=  []

						for neighbour in graph[vert]:
												if not visited[neighbour]:
																		order += topology_sort(snake_case__	,snake_case__	,snake_case__		)

						order.append(snake_case__		)

						return order

def 	__lowerCamelCase      (		snake_case__	,snake_case__	,snake_case__		)							->  list[int]:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE     				=  True
						_SCREAMING_SNAKE_CASE     				=  [vert]

						for neighbour in reversed_graph[vert]:
												if not visited[neighbour]:
																		component += find_components(snake_case__	,snake_case__	,snake_case__		)

						return component




def 	__lowerCamelCase      (		snake_case__		)							->  list[list[int]]:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE     				=  len(snake_case__		) * [False]
						_SCREAMING_SNAKE_CASE     				=  {vert: [] for vert in range(len(snake_case__		)		)}

						for vert, neighbours in graph.items():
												for neighbour in neighbours:
																		reversed_graph[neighbour].append(snake_case__		)

						_SCREAMING_SNAKE_CASE     				=  []
						for i, was_visited in enumerate(snake_case__		):
												if not was_visited:
																		order += topology_sort(snake_case__	,snake_case__	,snake_case__		)

						_SCREAMING_SNAKE_CASE     				=  []
						_SCREAMING_SNAKE_CASE     				=  len(snake_case__		) * [False]

						for i in range(len(snake_case__		)		):
												_SCREAMING_SNAKE_CASE     				=  order[len(snake_case__		) - i - 1]
												if not visited[vert]:
																		_SCREAMING_SNAKE_CASE     				=  find_components(snake_case__	,snake_case__	,snake_case__		)
																		components_list.append(snake_case__		)

						return components_list

