

from ..utils import DummyObject, requires_backends
class 	_A						(					metaclass=__magic_name__):
  SCREAMING_SNAKE_CASE      : int    =					['''torch''', '''transformers''', '''invisible_watermark''']

  def __init__(			self	,   *_SCREAMING_SNAKE_CASE	,   **_SCREAMING_SNAKE_CASE   ):





        """simple docstring"""







        requires_backends(self	,   ['torch', 'transformers', 'invisible_watermark']   )

  @classmethod
  def 	UpperCAmelCase      (			cls	,   *_SCREAMING_SNAKE_CASE	,   **_SCREAMING_SNAKE_CASE   ):





        """simple docstring"""







        requires_backends(cls	,   ['torch', 'transformers', 'invisible_watermark']   )



  @classmethod
  def 	UpperCAmelCase      (			cls	,   *_SCREAMING_SNAKE_CASE	,   **_SCREAMING_SNAKE_CASE   ):





        """simple docstring"""







        requires_backends(cls	,   ['torch', 'transformers', 'invisible_watermark']   )

class 	_A						(					metaclass=__magic_name__):
  SCREAMING_SNAKE_CASE      : Any    =					['''torch''', '''transformers''', '''invisible_watermark''']

  def __init__(			self	,   *_SCREAMING_SNAKE_CASE	,   **_SCREAMING_SNAKE_CASE   ):





        """simple docstring"""







        requires_backends(self	,   ['torch', 'transformers', 'invisible_watermark']   )

  @classmethod
  def 	UpperCAmelCase      (			cls	,   *_SCREAMING_SNAKE_CASE	,   **_SCREAMING_SNAKE_CASE   ):





        """simple docstring"""







        requires_backends(cls	,   ['torch', 'transformers', 'invisible_watermark']   )



  @classmethod
  def 	UpperCAmelCase      (			cls	,   *_SCREAMING_SNAKE_CASE	,   **_SCREAMING_SNAKE_CASE   ):





        """simple docstring"""







        requires_backends(cls	,   ['torch', 'transformers', 'invisible_watermark']   )





from math import factorial

def 				A_					(							a   ,				a					):

      """simple docstring"""



      return factorial(a					) / (factorial(a					) * factorial(n - r					))

def 				A_					(							):

      """simple docstring"""



      SCREAMING_SNAKE_CASE_			:					Union[str, Any]          =       0

      for i in range(1   ,				1_0_1					):
            for j in range(1   ,				i + 1					):
                  if combinations(a   ,				a					) > 1e6:
                        total += 1
      return total


if __name__ == "__main__":
    print(solution())






