def is_prime(n): if n < 2: return False for i in range(2, int(n**0.5) + 1): if n % i == 0: return False return True def kth_prime(k): count = 0 num = 1 while count < k: num += 1 if is_prime(num): count += 1 return num while True: try: n = int(input()) print(kth_prime(n)) except: break