






"""simple docstring"""


from typing import TYPE_CHECKING

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


_UpperCamelCase				:    Any     =						{'configuration_bit': ['BIT_PRETRAINED_CONFIG_ARCHIVE_MAP', 'BitConfig', 'BitOnnxConfig']}

try:
   if not is_torch_available():
      raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
   pass
else:
   _UpperCamelCase				:    List[str]     =						[
       'BIT_PRETRAINED_MODEL_ARCHIVE_LIST',
       'BitForImageClassification',
       'BitModel',
       'BitPreTrainedModel',
       'BitBackbone',
   ]


try:
   if not is_vision_available():
      raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
   pass
else:
   _UpperCamelCase				:    List[str]     =						['BitImageProcessor']


if TYPE_CHECKING:
   from .configuration_bit import BIT_PRETRAINED_CONFIG_ARCHIVE_MAP, BitConfig, BitOnnxConfig

   try:
      if not is_torch_available():
         raise OptionalDependencyNotAvailable()
   except OptionalDependencyNotAvailable:
      pass
   else:
      from .modeling_bit import (
          BIT_PRETRAINED_MODEL_ARCHIVE_LIST,
          BitBackbone,
          BitForImageClassification,
          BitModel,
          BitPreTrainedModel,
      )

   try:
      if not is_vision_available():
         raise OptionalDependencyNotAvailable()
   except OptionalDependencyNotAvailable:
      pass
   else:
      from .image_processing_bit import BitImageProcessor

else:
   import sys

   _UpperCamelCase				:    str     =						_LazyModule(__name__, globals()['__file__'], _import_structure)












"""simple docstring"""


def 			snake_case  (A_      :int = 1_0_0_0      ):







  '''simple docstring'''

  a     :			Union[str, Any]				=   0
  a     :			int				=   (n - 1) // 3
  total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
  a     :			Tuple				=   (n - 1) // 5
  total += ((terms) * (1_0 + (terms - 1) * 5)) // 2
  a     :			Dict				=   (n - 1) // 1_5
  total -= ((terms) * (3_0 + (terms - 1) * 1_5)) // 2
  return total


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




