
'''simple docstring'''






def 	_A  (					):






 """simple docstring"""



 return 1


def 	_A  (					A__   ):






 """simple docstring"""



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


def 	_A  (					A__   ):






 """simple docstring"""



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


def 	_A  (					A__   ):






 """simple docstring"""



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


def 	_A  (					A__   ):






 """simple docstring"""



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


def 	_A  (					A__   ):






 """simple docstring"""



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


def 	_A  (					A__   ):






 """simple docstring"""



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


def 	_A  (					A__   ):






 """simple docstring"""



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


def 	_A  (					A__ = 200   ):






 """simple docstring"""



 return two_pound(UpperCamelCase__   )


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




'''simple docstring'''






def 	_A  (					):






 """simple docstring"""



 for n in range(1  ,       1000000   ):
  yield n * (n + 1) // 2


def 	_A  (					A__   ):






 """simple docstring"""



 __lowercase													=				1
 __lowercase													=				2
 while i * i <= n:
  __lowercase													=				0
  while n % i == 0:
   n //= i
   multiplicity += 1
  divisors_count *= multiplicity + 1
  i += 1
 if n > 1:
  divisors_count *= 2
 return divisors_count


def 	_A  (					):






 """simple docstring"""



 return next(i for i in triangle_number_generator() if count_divisors(A__   ) > 500   )


if __name__ == "__main__":
 print(solution())

