

"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					int = 6008_5147_5143			):

     try:
          A__										=  int(UpperCAmelCase_			)
     except (TypeError, ValueError):
          raise TypeError("""Parameter n must be int or castable to int."""			)
     if n <= 0:
          raise ValueError("""Parameter n must be greater than or equal to one."""			)
     A__										=  1
     A__										=  2
     while i * i <= n:
          while n % i == 0:
               A__										=  i
               n //= i
          i += 1
     if n > 1:
          A__										=  n
     return int(UpperCAmelCase_			)


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









"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					Optional[Any]					,   UpperCAmelCase_  :					Optional[Any]			):
     A__										=  [0 for i in range(r + 1			)]
     # nc0 = 1
     A__										=  1
     for i in range(1					,   n + 1			):
          # to compute current row from previous row.
          A__										=  min(UpperCAmelCase_					,   UpperCAmelCase_			)
          while j > 0:
               c[j] += c[j - 1]
               j -= 1
     return c[r]

print(binomial_coefficient(n=1_0, r=5))






