




import importlib
import sys
from argparse import REMAINDER, ArgumentParser
from pathlib import Path

import torch_xla.distributed.xla_multiprocessing as xmp


def 							__SCREAMING_SNAKE_CASE						(    ):

						'''simple docstring'''


						_UpperCAmelCase									=  ArgumentParser(
						    description=(
						        "PyTorch TPU distributed training launch helper utility that will spawn up multiple distributed processes"
						    )		)

						# Optional arguments for the launch helper
						parser.add_argument("--num_cores"			,					type=snake_case_			,					default=1			,					help="Number of TPU cores to use (1 or 8)."		)

						# positional
						parser.add_argument(
						    "training_script"			,					type=snake_case_			,					help=(
						        "The full path to the single TPU training "
						        "program/script to be launched in parallel, "
						        "followed by all the arguments for the "
						        "training script"
						    )			,					)

						# rest from the training program
						parser.add_argument("training_script_args"			,					nargs=snake_case_		)

						return parser.parse_args()


def 							__SCREAMING_SNAKE_CASE						(    ):

						'''simple docstring'''


						_UpperCAmelCase									=  parse_args()

						# Import training_script as a module.
						_UpperCAmelCase									=  Path(args.training_script		)
						sys.path.append(str(script_fpath.parent.resolve()		)		)
						_UpperCAmelCase									=  script_fpath.stem
						_UpperCAmelCase									=  importlib.import_module(snake_case_		)

						# Patch sys.argv
						_UpperCAmelCase									=  [args.training_script] + args.training_script_args + ["--tpu_num_cores", str(args.num_cores		)]

						xmp.spawn(mod._mp_fn			,					args=()			,					nprocs=args.num_cores		)


if __name__ == "__main__":
				main()










def 							__SCREAMING_SNAKE_CASE						(    snake_case_ = 99_8001		):

						'''simple docstring'''


						for number in range(n - 1			,					9999			,					-1		):
												_UpperCAmelCase									=  str(snake_case_		)

												# checks whether 'str_number' is a palindrome.
												if str_number == str_number[::-1]:
																		_UpperCAmelCase									=  999

																		# if 'number' is a product of two 3-digit numbers
																		# then number is the answer otherwise fetch next number.
																		while divisor != 99:
																								if (number % divisor == 0) and (len(str(number // divisor		)		) == 3.0):
																														return number
																								divisor -= 1
						raise ValueError("That number is larger than our acceptable range."		)


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




