

from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_sentencepiece_available, is_tokenizers_available


lowerCAmelCase       :				Dict         =					{}

try:
    if not is_sentencepiece_available():
        raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
    pass
else:
    lowerCAmelCase       :				Union[str, Any]         =					['MBart50Tokenizer']

try:
    if not is_tokenizers_available():
        raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
    pass
else:
    lowerCAmelCase       :				Dict         =					['MBart50TokenizerFast']


if TYPE_CHECKING:
    try:
        if not is_sentencepiece_available():
            raise OptionalDependencyNotAvailable()
    except OptionalDependencyNotAvailable:
        pass
    else:
        from .tokenization_mbartaa import MBartaaTokenizer

    try:
        if not is_tokenizers_available():
            raise OptionalDependencyNotAvailable()
    except OptionalDependencyNotAvailable:
        pass
    else:
        from .tokenization_mbartaa_fast import MBartaaTokenizerFast

else:
    import sys

    lowerCAmelCase       :				List[Any]         =					_LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)









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())






