


import re
def 				UpperCAmelCase_					(							__snake_case						)     ->			str:







 """simple docstring"""


 if len(re.findall('''[ATCG]'''     ,						__a						)						) != len(__a						):
  raise ValueError('''Invalid Strand'''						)

 return dna.translate(dna.maketrans('''ATCG'''     ,						'''TAGC'''						)						)


if __name__ == "__main__":
  import doctest

  doctest.testmod()








import itertools
import math





def      lowerCAmelCase_ (       __a		)     ->		bool:







  """simple docstring"""





  if 1 < number < 4:
    # 2 and 3 are primes
    return True
  elif number < 2 or number % 2 == 0 or number % 3 == 0:
    # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
    return False

  # All primes number are in format of 6k +/- 1
  for i in range(5	,    int(math.sqrt(__a		) + 1		)	,    6		):
    if number % i == 0 or number % (i + 2) == 0:
      return False
  return True





def      lowerCAmelCase_ (       )     ->		str:







  """simple docstring"""





  lowerCamelCase__:      Optional[int]			  =2
  while True:
    if is_prime(__a		):
      yield num
    num += 1





def      lowerCAmelCase_ (       __a = 10001		)     ->		int:







  """simple docstring"""





  return next(itertools.islice(prime_generator()	,    nth - 1	,    __a		)		)


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

