






'''simple docstring'''







from typing import TYPE_CHECKING

from ...utils import (
    OptionalDependencyNotAvailable,
    _LazyModule,
    is_flax_available,
    is_tf_available,
    is_torch_available,
)


_A	:			Any         ={'''configuration_unispeech''': ['''UNISPEECH_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''UniSpeechConfig''']}

try:
			if not is_torch_available():
						raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
			pass
else:
			_A	:			Any         =[
			    '''UNISPEECH_PRETRAINED_MODEL_ARCHIVE_LIST''',
			    '''UniSpeechForCTC''',
			    '''UniSpeechForPreTraining''',
			    '''UniSpeechForSequenceClassification''',
			    '''UniSpeechModel''',
			    '''UniSpeechPreTrainedModel''',
			]

if TYPE_CHECKING:
			from .configuration_unispeech import UNISPEECH_PRETRAINED_CONFIG_ARCHIVE_MAP, UniSpeechConfig

			try:
						if not is_torch_available():
									raise OptionalDependencyNotAvailable()
			except OptionalDependencyNotAvailable:
						pass
			else:
						from .modeling_unispeech import (
						    UNISPEECH_PRETRAINED_MODEL_ARCHIVE_LIST,
						    UniSpeechForCTC,
						    UniSpeechForPreTraining,
						    UniSpeechForSequenceClassification,
						    UniSpeechModel,
						    UniSpeechPreTrainedModel,
						)

else:
			import sys

			_A	:			Dict         =_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() = }')

