


"""simple docstring"""


from math import sqrt







def  __snake_case       (   UpperCamelCase__	)      ->		bool:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (
		    number >= 0
		), "'number' must been an int and positive"

		A					       = True

		# 0 and 1 are none primes.
		if number <= 1:
				A					       = False

		for divisor in range(2 ,			int(round(sqrt(UpperCamelCase__	)	)	) + 1	):
				# if 'number' divisible by 'divisor' then sets 'status'
				# of false and break up the loop.
				if number % divisor == 0:
						A					       = False
						break

    # precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	), "'status' must been from type bool"

		return status







def  __snake_case       (   UpperCamelCase__	)      ->		Optional[int]:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (n > 2), "'N' must been an int and > 2"

		# beginList: contains all natural numbers from 2 up to N
		A					       = list(range(2 ,			n + 1	)	)

		A					       = []  # this list will be returns.

		# actual sieve of erathostenes
		for i in range(len(UpperCamelCase__	)	):
				for j in range(i + 1 ,			len(UpperCamelCase__	)	):
						if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
								A					       = 0

    # filters actual prime numbers.
		A					       = [x for x in begin_list if x != 0]

		# precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	), "'ans' must been from type list"

		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		List[str]:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (n > 2), "'N' must been an int and > 2"

		A					       = []

		# iterates over all numbers between 2 up to N+1
		# if a number is prime then appends to list 'ans'
		for number in range(2 ,			n + 1	):
				if is_prime(UpperCamelCase__	):
						ans.append(UpperCamelCase__	)

    # precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	), "'ans' must been from type list"

		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		Optional[int]:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and number >= 0, "'number' must been an int and >= 0"

		A					       = []  # this list will be returns of the function.

		# potential prime number factors.

		A					       = 2

		A					       = number

		if number == 0 or number == 1:
				ans.append(UpperCamelCase__	)

		# if 'number' not prime then builds the prime factorization of 'number'
		elif not is_prime(UpperCamelCase__	):
				while quotient != 1:
						if is_prime(UpperCamelCase__	) and (quotient % factor == 0):
								ans.append(UpperCamelCase__	)
								quotient /= factor
						else:
								factor += 1

		else:
				ans.append(UpperCamelCase__	)

		# precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	), "'ans' must been from type list"

		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		Optional[int]:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (
		    number >= 0
		), "'number' bust been an int and >= 0"

		A					       = 0

		# prime factorization of 'number'
		A					       = prime_factorization(UpperCamelCase__	)

		A					       = max(UpperCamelCase__	)

		# precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	), "'ans' must been from type int"

		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		Union[str, Any]:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (
		    number >= 0
		), "'number' bust been an int and >= 0"

		A					       = 0

		# prime factorization of 'number'
		A					       = prime_factorization(UpperCamelCase__	)

		A					       = min(UpperCamelCase__	)

		# precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	), "'ans' must been from type int"

		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		List[str]:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	), "'number' must been an int"
		assert isinstance(number % 2 == 0 ,			UpperCamelCase__	), "compare bust been from type bool"

		return number % 2 == 0







def  __snake_case       (   UpperCamelCase__	)      ->		str:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	), "'number' must been an int"
		assert isinstance(number % 2 != 0 ,			UpperCamelCase__	), "compare bust been from type bool"

		return number % 2 != 0







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





		assert (
		    isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (number > 2) and is_even(UpperCamelCase__	)
		), "'number' must been an int, even and > 2"

		A					       = []  # this list will returned

		# creates a list of prime numbers between 2 up to 'number'
		A					       = get_prime_numbers(UpperCamelCase__	)
		A					       = len(UpperCamelCase__	)

		# run variable for while-loops.
		A					       = 0
		A					       = None

		# exit variable. for break up the loops
		A					       = True

		while i < len_pn and loop:
				A					       = i + 1

				while j < len_pn and loop:
						if prime_numbers[i] + prime_numbers[j] == number:
								A					       = False
								ans.append(prime_numbers[i]	)
								ans.append(prime_numbers[j]	)

						j += 1

				i += 1

		# precondition
		assert (
		    isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and (len(UpperCamelCase__	) == 2)
		    and (ans[0] + ans[1] == number)
		    and is_prime(ans[0]	)
		    and is_prime(ans[1]	)
		), "'ans' must contains two primes. And sum of elements must been eq 'number'"

		return ans







def  __snake_case       (   UpperCamelCase__ ,			UpperCamelCase__	)      ->		Tuple:







		"""simple docstring"""





		assert (
		    isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and (numbera >= 0)
		    and (numbera >= 0)
		), "'number1' and 'number2' must been positive integer."

		A					       = 0

		while numbera != 0:
				A					       = numbera % numbera
				A					       = numbera
				A					       = rest

		# precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (
		    numbera >= 0
		), "'number' must been from type int and positive"

		return numbera







def  __snake_case       (   UpperCamelCase__ ,			UpperCamelCase__	)      ->		Any:







		"""simple docstring"""





		assert (
		    isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and (numbera >= 1)
		    and (numbera >= 1)
		), "'number1' and 'number2' must been positive integer."

		A					       = 1  # actual answer that will be return.

		# for kgV (x,1)
		if numbera > 1 and numbera > 1:
				# builds the prime factorization of 'number1' and 'number2'
				A					       = prime_factorization(UpperCamelCase__	)
				A					       = prime_factorization(UpperCamelCase__	)

		elif numbera == 1 or numbera == 1:
				A					       = []
				A					       = []
				A					       = max(UpperCamelCase__ ,			UpperCamelCase__	)

		A					       = 0
		A					       = 0

		A					       = []  # captured numbers int both 'primeFac1' and 'primeFac2'

		# iterates through primeFac1
		for n in prime_fac_a:
				if n not in done:
						if n in prime_fac_a:
								A					       = prime_fac_a.count(UpperCamelCase__	)
								A					       = prime_fac_a.count(UpperCamelCase__	)

								for _ in range(max(UpperCamelCase__ ,			UpperCamelCase__	)	):
										ans *= n

						else:
								A					       = prime_fac_a.count(UpperCamelCase__	)

								for _ in range(UpperCamelCase__	):
										ans *= n

						done.append(UpperCamelCase__	)

    # iterates through primeFac2
		for n in prime_fac_a:
				if n not in done:
						A					       = prime_fac_a.count(UpperCamelCase__	)

						for _ in range(UpperCamelCase__	):
								ans *= n

						done.append(UpperCamelCase__	)

    # precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (
		    ans >= 0
		), "'ans' must been from type int and positive"

		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		Dict:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (n >= 0), "'number' must been a positive int"

		A					       = 0
		A					       = 2  # this variable holds the answer

		while index < n:
				index += 1

				ans += 1  # counts to the next number

				# if ans not prime then
				# runs to the next prime number.
				while not is_prime(UpperCamelCase__	):
						ans += 1

    # precondition
		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and is_prime(
		    UpperCamelCase__	), "'ans' must been a prime number and from type int"

		return ans







def  __snake_case       (   UpperCamelCase__ ,			UpperCamelCase__	)      ->		Any:







		"""simple docstring"""





		assert (
		    is_prime(UpperCamelCase__	) and is_prime(UpperCamelCase__	) and (p_number_a < p_number_a)
		), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

		A					       = p_number_a + 1  # jump to the next number

		A					       = []  # this list will be returns.

		# if number is not prime then
		# fetch the next prime number.
		while not is_prime(UpperCamelCase__	):
				number += 1

		while number < p_number_a:
				ans.append(UpperCamelCase__	)

				number += 1

				# fetch the next prime number.
				while not is_prime(UpperCamelCase__	):
						number += 1

    # precondition
		assert (
		    isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and ans[0] != p_number_a
		    and ans[len(UpperCamelCase__	) - 1] != p_number_a
		), "'ans' must been a list without the arguments"

		# 'ans' contains not 'pNumber1' and 'pNumber2' !
		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		Dict:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (n >= 1), "'n' must been int and >= 1"

		A					       = []  # will be returned.

		for divisor in range(1 ,			n + 1	):
				if n % divisor == 0:
						ans.append(UpperCamelCase__	)

    # precondition
		assert ans[0] == 1 and ans[len(UpperCamelCase__	) - 1] == n, "Error in function getDivisiors(...)"

		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		Any:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (
		    number > 1
		), "'number' must been an int and >= 1"

		A					       = get_divisors(UpperCamelCase__	)

		# precondition
		assert (
		    isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and (divisors[0] == 1)
		    and (divisors[len(UpperCamelCase__	) - 1] == number)
		), "Error in help-function getDivisiors(...)"

		# summed all divisors up to 'number' (exclusive), hence [:-1]
		return sum(divisors[:-1]	) == number







def  __snake_case       (   UpperCamelCase__ ,			UpperCamelCase__	)      ->		int:







		"""simple docstring"""





		assert (
		    isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and (denominator != 0)
		), "The arguments must been from type int and 'denominator' != 0"

		# build the greatest common divisor of numerator and denominator.
		A					       = gcd(abs(UpperCamelCase__	) ,			abs(UpperCamelCase__	)	)

		# precondition
		assert (
		    isinstance(UpperCamelCase__ ,			UpperCamelCase__	)
		    and (numerator % gcd_of_fraction == 0)
		    and (denominator % gcd_of_fraction == 0)
		), "Error in function gcd(...,...)"

		return (numerator // gcd_of_fraction, denominator // gcd_of_fraction)







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (n >= 0), "'n' must been a int and >= 0"

		A					       = 1  # this will be return.

		for factor in range(1 ,			n + 1	):
				ans *= factor

		return ans







def  __snake_case       (   UpperCamelCase__	)      ->		str:







		"""simple docstring"""





		assert isinstance(UpperCamelCase__ ,			UpperCamelCase__	) and (n >= 0), "'n' must been an int and >= 0"

		A					       = 0
		A					       = 1
		A					       = 1  # this will be return

		for _ in range(n - 1	):
				A					       = ans
				ans += fiba
				A					       = tmp

		return ans









"""simple docstring"""


def  __snake_case       (   )      ->		int:







		"""simple docstring"""





		return 1







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





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







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





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







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





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







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





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







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





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







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





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







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





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







def  __snake_case       (   UpperCamelCase__ = 200	)      ->		int:







		"""simple docstring"""





		return two_pound(UpperCamelCase__	)


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





