




def 			_a   (		SCREAMING_SNAKE_CASE_							:       list[int]  ):
					__lowerCAmelCase            = []
					if len(SCREAMING_SNAKE_CASE_  ) == 1:
										return [nums.copy()]
					for _ in range(len(SCREAMING_SNAKE_CASE_  )  ):
										__lowerCAmelCase            = nums.pop(0  )
										__lowerCAmelCase            = permute(SCREAMING_SNAKE_CASE_  )
										for perm in permutations:
															perm.append(SCREAMING_SNAKE_CASE_  )
										result.extend(SCREAMING_SNAKE_CASE_  )
										nums.append(SCREAMING_SNAKE_CASE_  )
					return result







def 			_a   (		SCREAMING_SNAKE_CASE_							:       Union[str, Any]  ):

					def backtrack(SCREAMING_SNAKE_CASE_							:       List[str]  ):
										if start == len(SCREAMING_SNAKE_CASE_  ) - 1:
															output.append(nums[:]  )
										else:
															for i in range(SCREAMING_SNAKE_CASE_   ,   len(SCREAMING_SNAKE_CASE_  )  ):
																				__lowerCAmelCase     ,							__lowerCAmelCase            = nums[i], nums[start]
																				backtrack(start + 1  )
																				__lowerCAmelCase     ,							__lowerCAmelCase            = nums[i], nums[start]  # backtrack

					__lowerCAmelCase            = []
					backtrack(0  )
					return output


if __name__ == "__main__":
					import doctest

					# use res to print the data in permute2 function
					UpperCamelCase__					    =    permutea([1, 2, 3])
					print(res)
					doctest.testmod()










def 			_a   (		SCREAMING_SNAKE_CASE_							:       int  ):
					if divisor % 5 == 0 or divisor % 2 == 0:
										return 0
					__lowerCAmelCase            = 1
					__lowerCAmelCase            = 1
					while repunit:
										__lowerCAmelCase            = (10 * repunit + 1) % divisor
										repunit_index += 1
					return repunit_index







def 			_a   (		SCREAMING_SNAKE_CASE_							:       int = 1_00_00_00  ):
					__lowerCAmelCase            = limit - 1
					if divisor % 2 == 0:
										divisor += 1
					while least_divisible_repunit(SCREAMING_SNAKE_CASE_  ) <= limit:
										divisor += 2
					return divisor


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




