





def       A__(		__lowerCAmelCase ):
				return [
				    txt[:a] + txt[a].upper() + txt[a + 1 :]
				    for a in range(len(__lowerCAmelCase ) )
				    if txt[a].isalpha()
				]


if __name__ == "__main__":
		__import__('''doctest''').testmod()













import math

def       A__(		__lowerCAmelCase ):

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

def       A__(		__lowerCAmelCase = 1_00_01 ):

				try:
								_snake_case :			int  						=   int(__lowerCAmelCase )
				except (TypeError, ValueError):
								raise TypeError('Parameter nth must be int or castable to int.' ) from None
				if nth <= 0:
								raise ValueError('Parameter nth must be greater than or equal to one.' )
				_snake_case :			list[int]  						=   []
				_snake_case :			List[Any]  						=   2
				while len(__lowerCAmelCase ) < nth:
								if is_prime(__lowerCAmelCase ):
												primes.append(__lowerCAmelCase )
												num += 1
								else:
												num += 1
				return primes[len(__lowerCAmelCase ) - 1]


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






