

'''simple docstring'''





from typing import TYPE_CHECKING

# rely on isort to merge the imports
from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


SCREAMING_SNAKE_CASE_:					Dict  ={
    'configuration_autoformer': [
        'AUTOFORMER_PRETRAINED_CONFIG_ARCHIVE_MAP',
        'AutoformerConfig',
    ],
}

try:
    if not is_torch_available():
        raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
    pass
else:
    SCREAMING_SNAKE_CASE_:					Optional[Any]  =[
        'AUTOFORMER_PRETRAINED_MODEL_ARCHIVE_LIST',
        'AutoformerForPrediction',
        'AutoformerModel',
        'AutoformerPreTrainedModel',
    ]


if TYPE_CHECKING:
    from .configuration_autoformer import (
        AUTOFORMER_PRETRAINED_CONFIG_ARCHIVE_MAP,
        AutoformerConfig,
    )

    try:
        if not is_torch_available():
            raise OptionalDependencyNotAvailable()
    except OptionalDependencyNotAvailable:
        pass
    else:
        from .modeling_autoformer import (
            AUTOFORMER_PRETRAINED_MODEL_ARCHIVE_LIST,
            AutoformerForPrediction,
            AutoformerModel,
            AutoformerPreTrainedModel,
        )

else:
    import sys

    SCREAMING_SNAKE_CASE_:					str  =_LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)





'''simple docstring'''





def      lowerCAmelCase_    ( snake_case_	:			int = 1_00_00_00      )   ->				int:


     '''simple docstring'''




     UpperCAmelCase_	   =       limit + 1
     UpperCAmelCase_	   =       [0] * limit
     for first_term in range(1 ,   snake_case_      ):
          for n in range(snake_case_ ,   snake_case_ ,   snake_case_      ):
               UpperCAmelCase_	   =       first_term + n / first_term
               if common_difference % 4:  # d must be divisble by 4
                    continue
               else:
                    common_difference /= 4
                    if (
                        first_term > common_difference
                        and first_term < 4 * common_difference
                    ):  # since x,y,z are positive integers
                         frequency[n] += 1  # so z>0 and a>d ,also 4d<a

     UpperCAmelCase_	   =       sum(1 for x in frequency[1:limit] if x == 10      )

     return count


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




