
def       A       (					)   ->  int:
		'''simple docstring'''

		return 1


def       A       (					lowercase )   ->  int:
		'''simple docstring'''

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


def       A       (					lowercase )   ->  int:
		'''simple docstring'''

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


def       A       (					lowercase )   ->  int:
		'''simple docstring'''

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


def       A       (					lowercase )   ->  int:
		'''simple docstring'''

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


def       A       (					lowercase )   ->  int:
		'''simple docstring'''

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


def       A       (					lowercase )   ->  int:
		'''simple docstring'''

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


def       A       (					lowercase )   ->  int:
		'''simple docstring'''

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


def       A       (					lowercase = 200 )   ->  int:
		'''simple docstring'''

		return two_pound(lowercase )


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


from __future__ import annotations

import os
from collections.abc import Mapping

_UpperCAmelCase					: Tuple      =       tuple[int, int]


class 				lowercase					:



		def __init__( self				,      A_				,      A_       )  ->					None:
				"""simple docstring"""
				UpperCamelCase		=     vertices
				UpperCamelCase		=     {
				    (min(A_       ), max(A_       )): weight for edge, weight in edges.items()
				}



		def __UpperCamelCase ( self				,      A_				,      A_       )  ->					None:
				"""simple docstring"""
				self.vertices.add(edge[0]       )
				self.vertices.add(edge[1]       )
				UpperCamelCase		=     weight



		def __UpperCamelCase ( self       )  ->					Graph:
				"""simple docstring"""
				UpperCamelCase		=     Graph({min(self.vertices       )}				,      {}       )
				UpperCamelCase		=     42
				UpperCamelCase		=     42
				UpperCamelCase		=     42
				UpperCamelCase		=     42

				while len(subgraph.vertices       ) < len(self.vertices       ):
						UpperCamelCase		=     max(self.edges.values()       ) + 1
						for edge, weight in self.edges.items():
								if (edge[0] in subgraph.vertices) ^ (edge[1] in subgraph.vertices):
										if weight < min_weight:
												UpperCamelCase		=     edge
												UpperCamelCase		=     weight

						subgraph.add_edge(A_				,      A_       )

				return subgraph






def       A       (					lowercase = "p107_network.txt" )   ->  int:
		'''simple docstring'''

		UpperCamelCase		=     os.path.abspath(os.path.dirname(lowercase ) )
		UpperCamelCase		=     os.path.join(lowercase    ,       lowercase )
		UpperCamelCase		=     {}
		UpperCamelCase		=     42
		UpperCamelCase		=     42
		UpperCamelCase		=     42

		with open(lowercase ) as f:
				UpperCamelCase		=     f.read().strip().split('\n' )

		UpperCamelCase		=     [line.split(',' ) for line in data]

		for edgea in range(1    ,       len(lowercase ) ):
				for edgea in range(lowercase ):
						if adjaceny_matrix[edgea][edgea] != "-":
								UpperCamelCase		=     int(adjaceny_matrix[edgea][edgea] )

		UpperCamelCase		=     Graph(set(range(len(lowercase ) ) )    ,       lowercase )

		UpperCamelCase		=     graph.prims_algorithm()

		UpperCamelCase		=     sum(graph.edges.values() )
		UpperCamelCase		=     sum(subgraph.edges.values() )

		return initial_total - optimal_total


if __name__ == "__main__":
					print(F'''{solution() = }''')
