





import string

def   __snake_case    (       _lowerCAmelCase			:			str						)			->    str:
   A_       :					Optional[Any]        =      ""
   for i in sequence:
      A_       :					Dict        =      ord(_lowerCAmelCase						)
      if 65 <= extract <= 90:
         output += chr(155 - extract						)
      elif 97 <= extract <= 122:
         output += chr(219 - extract						)
      else:
         output += i
   return output

def   __snake_case    (       _lowerCAmelCase			:			str						)			->    str:
   A_       :					List[Any]        =      string.ascii_letters
   A_       :					List[Any]        =      string.ascii_lowercase[::-1] + string.ascii_uppercase[::-1]
   return "".join(
       letters_reversed[letters.index(_lowerCAmelCase						)] if c in letters else c for c in sequence						)

def   __snake_case    (       )			->    None:
   from timeit import timeit

   print("Running performance benchmarks..."						)
   A_       :					Optional[int]        =      "from string import printable ; from __main__ import atbash, atbash_slow"
   print(f"> atbash_slow(): {timeit('atbash_slow(printable)'					,					setup=_lowerCAmelCase						)} seconds"						)
   print(f">      atbash(): {timeit('atbash(printable)'					,					setup=_lowerCAmelCase						)} seconds"						)


if __name__ == "__main__":
 for example in ("ABCDEFGH", "123GGjj", "testStringtest", "with space"):
  print(F'''{example} encrypted in atbash: {atbash(example)}''')
 benchmark()







from math import sqrt

def   __snake_case    (       _lowerCAmelCase			:			int						)			->    bool:

   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(sqrt(_lowerCAmelCase						) + 1						)					,					6						):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True

def   __snake_case    (       _lowerCAmelCase			:			int = 10001						)			->    int:
   A_       :					Any        =      0
   A_       :					Tuple        =      1
   while count != nth and number < 3:
      number += 1
      if is_prime(_lowerCAmelCase						):
         count += 1
   while count != nth:
      number += 2
      if is_prime(_lowerCAmelCase						):
         count += 1
   return number


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