



from maths.prime_factors import prime_factors






def 				A				(					_lowerCamelCase  ):





							'''simple docstring'''




							if not isinstance(_lowerCamelCase				, _lowerCamelCase  ):
														_lowerCAmelCase     :							int    =    F"Input value of [number={number}] must be an integer"
														raise TypeError(_lowerCamelCase  )
							if number < 1:
														raise ValueError("Input must be a positive integer"  )
							return -1 if len(prime_factors(_lowerCamelCase  )  ) % 2 else 1


if __name__ == "__main__":
						import doctest

						doctest.testmod()

"""simple docstring"""






def 			UpperCAmelCase__       (				lowerCAmelCase__     :str					,		lowerCAmelCase__     :Optional[Any]		) ->    int:
      '''simple docstring'''


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






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



