




from typing import TYPE_CHECKING

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


__UpperCamelCase      : List[Any]					      =   {"configuration_hubert": ["HUBERT_PRETRAINED_CONFIG_ARCHIVE_MAP", "HubertConfig"]}

try:
		if not is_torch_available():
				raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
		pass
else:
		__UpperCamelCase      : Dict					      =   [
		    "HUBERT_PRETRAINED_MODEL_ARCHIVE_LIST",
		    "HubertForCTC",
		    "HubertForSequenceClassification",
		    "HubertModel",
		    "HubertPreTrainedModel",
		]


try:
		if not is_tf_available():
				raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
		pass
else:
		__UpperCamelCase      : List[str]					      =   [
		    "TF_HUBERT_PRETRAINED_MODEL_ARCHIVE_LIST",
		    "TFHubertForCTC",
		    "TFHubertModel",
		    "TFHubertPreTrainedModel",
		]

if TYPE_CHECKING:
		from .configuration_hubert import HUBERT_PRETRAINED_CONFIG_ARCHIVE_MAP, HubertConfig

		try:
				if not is_torch_available():
						raise OptionalDependencyNotAvailable()
		except OptionalDependencyNotAvailable:
				pass
		else:
				from .modeling_hubert import (
				    HUBERT_PRETRAINED_MODEL_ARCHIVE_LIST,
				    HubertForCTC,
				    HubertForSequenceClassification,
				    HubertModel,
				    HubertPreTrainedModel,
				)

		try:
				if not is_tf_available():
						raise OptionalDependencyNotAvailable()
		except OptionalDependencyNotAvailable:
				pass
		else:
				from .modeling_tf_hubert import (
				    TF_HUBERT_PRETRAINED_MODEL_ARCHIVE_LIST,
				    TFHubertForCTC,
				    TFHubertModel,
				    TFHubertPreTrainedModel,
				)


else:
		import sys

		__UpperCamelCase      : List[str]					      =   _LazyModule(__name__, globals()["__file__"], _import_structure, module_spec=__spec__)







from itertools import combinations, product





def 	__A	(			__lowerCamelCase							,    __lowerCamelCase							,    __lowerCamelCase							,    __lowerCamelCase					)   -> bool:
	if xa == ya == 0 or xa == ya == 0:
		return False
	a		       =							xa * xa + ya * ya
	a		       =							xa * xa + ya * ya
	a		       =							(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
	return (
	    a_square + b_square == c_square
	    or a_square + c_square == b_square
	    or b_square + c_square == a_square
	)





def 	__A	(			__lowerCamelCase = 50					)   -> int:
	return sum(
	    1
	    for pta, pta in combinations(product(range(limit + 1					)							,    repeat=2					)							,    2					)
	    if is_right(*__lowerCamelCase							,    *__lowerCamelCase					)					)


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

