def es_primo(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 nth_prime_number(n):
    count = 0
    i = 2
    while True:
        if es_primo(i):
            count += 1
            if count == n:
                return i
        i += 1

print(nth_prime_number(10000))
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence