
# Copyright 2023 The HuggingFace Team. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from typing import TYPE_CHECKING

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


A  :			Dict     				=				{
    'configuration_convnextv2': [
        'CONVNEXTV2_PRETRAINED_CONFIG_ARCHIVE_MAP',
        'ConvNextV2Config',
    ]
}

try:
					if not is_torch_available():
										raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
					pass
else:
					A  :			Union[str, Any]     				=				[
					    'CONVNEXTV2_PRETRAINED_MODEL_ARCHIVE_LIST',
					    'ConvNextV2ForImageClassification',
					    'ConvNextV2Model',
					    'ConvNextV2PreTrainedModel',
					    'ConvNextV2Backbone',
					]


if TYPE_CHECKING:
					from .configuration_convnextva import (
					    CONVNEXTV2_PRETRAINED_CONFIG_ARCHIVE_MAP,
					    ConvNextVaConfig,
					)

					try:
										if not is_torch_available():
															raise OptionalDependencyNotAvailable()
					except OptionalDependencyNotAvailable:
										pass
					else:
										from .modeling_convnextva import (
										    CONVNEXTV2_PRETRAINED_MODEL_ARCHIVE_LIST,
										    ConvNextVaBackbone,
										    ConvNextVaForImageClassification,
										    ConvNextVaModel,
										    ConvNextVaPreTrainedModel,
										)

else:
					import sys

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

def 					__lowerCAmelCase    (    a__ = 99_8001						) ->						int:
				__a    							=					0
				for i in range(999		,					99		,					-1						):  # 3 digit numbers range from 999 down to 100
								for j in range(999		,					99		,					-1						):
												__a    							=					str(i * j						)
												if product_string == product_string[::-1] and i * j < n:
																__a    							=					max(a__		,					i * j						)
				return answer


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