




"""simple docstring"""







def     snake_case__							(       _lowerCamelCase					)      ->int:






		"""simple docstring"""


		assert (
		    isinstance(snake_case__,	snake_case__					) and number_of_steps > 0
		), F'number_of_steps needs to be positive integer, your input {number_of_steps}'
		if number_of_steps == 1:
				return 1
		__lowercase    ,__lowercase					:		Optional[Any]        =					1, 1
		for _ in range(number_of_steps - 1					):
				__lowercase    ,__lowercase					:		int        =					current + previous, current
		return current


if __name__ == "__main__":
						import doctest

						doctest.testmod()






"""simple docstring"""




def        a__					(							)		->   int:
			return 1



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



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



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



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



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



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



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



def        a__					(							snake_case__ = 2_00							)		->   int:
			return two_pound(snake_case__							)


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



