

from typing import TYPE_CHECKING

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


lowerCamelCase 	=   {
    '''configuration_codegen''': ['''CODEGEN_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''CodeGenConfig''', '''CodeGenOnnxConfig'''],
    '''tokenization_codegen''': ['''CodeGenTokenizer'''],
}

try:
       if not is_tokenizers_available():
              raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
       pass
else:
       lowerCamelCase 	=   ['''CodeGenTokenizerFast''']

try:
       if not is_torch_available():
              raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
       pass
else:
       lowerCamelCase 	=   [
           '''CODEGEN_PRETRAINED_MODEL_ARCHIVE_LIST''',
           '''CodeGenForCausalLM''',
           '''CodeGenModel''',
           '''CodeGenPreTrainedModel''',
       ]

if TYPE_CHECKING:
       from .configuration_codegen import CODEGEN_PRETRAINED_CONFIG_ARCHIVE_MAP, CodeGenConfig, CodeGenOnnxConfig
       from .tokenization_codegen import CodeGenTokenizer

       try:
              if not is_tokenizers_available():
                     raise OptionalDependencyNotAvailable()
       except OptionalDependencyNotAvailable:
              pass
       else:
              from .tokenization_codegen_fast import CodeGenTokenizerFast

       try:
              if not is_torch_available():
                     raise OptionalDependencyNotAvailable()
       except OptionalDependencyNotAvailable:
              pass
       else:
              from .modeling_codegen import (
                  CODEGEN_PRETRAINED_MODEL_ARCHIVE_LIST,
                  CodeGenForCausalLM,
                  CodeGenModel,
                  CodeGenPreTrainedModel,
              )

else:
       import sys

       lowerCamelCase 	=   _LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)

"""simple docstring"""


from math import factorial







def    UpperCAmelCase       (						UpperCAmelCase		,   UpperCAmelCase   )							-> List[str]:
     return factorial(UpperCAmelCase   ) / (factorial(UpperCAmelCase   ) * factorial(n - r   ))







def    UpperCAmelCase       (						)							-> Optional[Any]:
     snake_case_   			=   0

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


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

