
def      UpperCamelCase   (       __lowerCamelCase	:					int = 1000       ):
       snake_case							,   snake_case			:  str     							= 1, 1
       snake_case			:  Dict     							= 2
       while True:
              snake_case			:  Optional[int]     							= 0
              snake_case			:  int     							= fa + fa
              snake_case							,   snake_case			:  int     							= fa, f
              index += 1
              for _ in str(__lowerCamelCase       ):
                     i += 1
              if i == n:
                     break
       return index


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







from math import factorial


def      UpperCamelCase   (       __lowerCamelCase	:					int							,   __lowerCamelCase	:					int							,   __lowerCamelCase	:					float       ):
       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(__lowerCamelCase							,   __lowerCamelCase       ) or not isinstance(__lowerCamelCase							,   __lowerCamelCase       ):
              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"       )
       snake_case			:  Tuple     							= (prob**successes) * ((1 - prob) ** (trials - successes))
       # Calculate the binomial coefficient: n! / k!(n-k)!
       snake_case			:  str     							= float(factorial(__lowerCamelCase       )       )
       coefficient /= factorial(__lowerCamelCase       ) * 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))





