

def  lowerCamelCase__ (					):
	return 1

def  lowerCamelCase__ (					_a):
	return 0 if x < 0 else two_pence(x - 2) + one_pence()

def  lowerCamelCase__ (					_a):
	return 0 if x < 0 else five_pence(x - 5) + two_pence(_a)

def  lowerCamelCase__ (					_a):
	return 0 if x < 0 else ten_pence(x - 10) + five_pence(_a)

def  lowerCamelCase__ (					_a):
	return 0 if x < 0 else twenty_pence(x - 20) + ten_pence(_a)

def  lowerCamelCase__ (					_a):
	return 0 if x < 0 else fifty_pence(x - 50) + twenty_pence(_a)

def  lowerCamelCase__ (					_a):
	return 0 if x < 0 else one_pound(x - 100) + fifty_pence(_a)

def  lowerCamelCase__ (					_a):
	return 0 if x < 0 else two_pound(x - 200) + one_pound(_a)

def  lowerCamelCase__ (					_a = 200):
	return two_pound(_a)


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


def  lowerCamelCase__ (					_a = 50):
	SCREAMING_SNAKE_CASE   :      int				     =       [1] * (length + 1)

	for row_length in range(length + 1):
		for tile_length in range(2							,			5):
			for tile_start in range(row_length - tile_length + 1):
				ways_number[row_length] += ways_number[
				    row_length - tile_start - tile_length
				]

	return ways_number[length]


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