

from math import factorial

def        lowerCamelCase__       (    _a							,	_a							,	_a):
	if successes > trials:
		raise ValueError("successes must be lower or equal to trials")
	if trials < 0 or successes < 0:
		raise ValueError("the function is defined for non-negative integers")
	if not isinstance(_a							,	_a) or not isinstance(_a							,	_a):
		raise ValueError("the function is defined for non-negative integers")
	if not 0 < prob < 1:
		raise ValueError("prob has to be in range of 1 - 0")
	SCREAMING_SNAKE_CASE      :					int    =				(prob**successes) * ((1 - prob) ** (trials - successes))
	# Calculate the binomial coefficient: n! / k!(n-k)!
	SCREAMING_SNAKE_CASE      :					List[Any]    =				float(factorial(_a))
	coefficient /= factorial(_a) * factorial(trials - successes)
	return probability * coefficient


if __name__ == "__main__":
			from doctest import testmod

			testmod()
			print('Probability of 2 successes out of 4 trails')
			print('with probability of 0.75 is:', end=' ')
			print(binomial_distribution(2, 4, 0.75))







"""simple docstring"""



def 						lowercase    (				__snake_case				: int = 1_0_0_0	):
		lowercase_       ,					lowercase_ : str							       =   1, 1
		lowercase_ : List[str]							       =   2
		while True:
				lowercase_ : Tuple							       =   0
				lowercase_ : List[Any]							       =   fa + fa
				lowercase_       ,					lowercase_ : Optional[int]							       =   fa, f
				index += 1
				for _ in str(__snake_case	):
						i += 1
				if i == n:
						break
		return index


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



