



'''simple docstring'''





from typing import TYPE_CHECKING

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


lowercase_		       =  {
    '''configuration_gpt_neox_japanese''': ['''GPT_NEOX_JAPANESE_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''GPTNeoXJapaneseConfig'''],
    '''tokenization_gpt_neox_japanese''': ['''GPTNeoXJapaneseTokenizer'''],
}

try:
  if not is_torch_available():
    raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
  pass
else:
  lowercase_		       =  [
      '''GPT_NEOX_JAPANESE_PRETRAINED_MODEL_ARCHIVE_LIST''',
      '''GPTNeoXJapaneseForCausalLM''',
      '''GPTNeoXJapaneseLayer''',
      '''GPTNeoXJapaneseModel''',
      '''GPTNeoXJapanesePreTrainedModel''',
  ]


if TYPE_CHECKING:
  from .configuration_gpt_neox_japanese import GPT_NEOX_JAPANESE_PRETRAINED_CONFIG_ARCHIVE_MAP, GPTNeoXJapaneseConfig
  from .tokenization_gpt_neox_japanese import GPTNeoXJapaneseTokenizer

  try:
    if not is_torch_available():
      raise OptionalDependencyNotAvailable()
  except OptionalDependencyNotAvailable:
    pass
  else:
    from .modeling_gpt_neox_japanese import (
        GPT_NEOX_JAPANESE_PRETRAINED_MODEL_ARCHIVE_LIST,
        GPTNeoXJapaneseForCausalLM,
        GPTNeoXJapaneseLayer,
        GPTNeoXJapaneseModel,
        GPTNeoXJapanesePreTrainedModel,
    )


else:
  import sys

  lowercase_		       =  _LazyModule(__name__, globals()["__file__"], _import_structure, module_spec=__spec__)











'''simple docstring'''







def  SCREAMING_SNAKE_CASE_       (UpperCamelCase = 1000      )      ->       int:
							lowerCamelCase__					:	str         =       -1
							lowerCamelCase__					:	Dict         =       0
							for a in range(1				,			n // 3      ):
														# Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
														lowerCamelCase__					:	Dict         =       (n * n - 2 * a * n) // (2 * n - 2 * a)
														lowerCamelCase__					:	Any         =       n - a - b
														if c * c == (a * a + b * b):
																					lowerCamelCase__					:	Dict         =       a * b * c
																					if candidate >= product:
																												lowerCamelCase__					:	Union[str, Any]         =       candidate
							return product


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

