

'''simple docstring'''



def 						__lowerCamelCase       (   __snake_case     :		Union[str, Any]       )       ->							list[list[int]]:






						"""simple docstring"""





						A__     :   int      =[]
						if len(lowercase__       ) == 1:
												return [nums.copy()]
						for _ in range(len(lowercase__       )       ):
												A__     :   List[Any]      =nums.pop(0       )
												A__     :   List[Any]      =permute(lowercase__       )
												for perm in permutations:
																		perm.append(lowercase__       )
												result.extend(lowercase__       )
												nums.append(lowercase__       )
						return result
def 						__lowerCamelCase       (   __snake_case     :		Optional[int]       )       ->							Optional[Any]:






						"""simple docstring"""





						def backtrack(__snake_case     :		List[str]       ):
												if start == len(lowercase__       ) - 1:
																		output.append(nums[:]       )
												else:
																		for i in range(lowercase__,		len(lowercase__       )       ):
																								A__    ,						A__     :   int      =nums[i], nums[start]
																								backtrack(start + 1       )
																								A__    ,						A__     :   Tuple      =nums[i], nums[start]  # backtrack

						A__     :   List[str]      =[]
						backtrack(0       )
						return output


if __name__ == "__main__":
		import doctest

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





from math import isqrt







def        _lowerCamelCase(	lowercase__	)						->	bool:

		'''simple docstring'''







		return all(number % divisor != 0 for divisor in range(2   , isqrt(lowercase__	) + 1	)	)







def        _lowerCamelCase(	lowercase__ = 1_0**6	)						->	int:

		'''simple docstring'''







		__lowercase=			0
		__lowercase=			1
		__lowercase=			7
		while prime_candidate < max_prime:
				primes_count += is_prime(lowercase__	)

				cube_index += 1
				prime_candidate += 6 * cube_index

		return primes_count


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






