def newman_prime(n):
    if n <= 0:
        raise ValueError("n must be a positive integer")

    count = 0
    index = 0

    while True:
        if index == 0:
            value = 1
        elif index == 1:
            value = 1
        else:
            a, b = 1, 1
            for _ in range(2, index + 1):
                a, b = b, 2 * b + a
            value = b

        if value > 1 and _is_prime(value):
            count += 1
            if count == n:
                return value

        index += 1


def _is_prime(number):
    if number < 2:
        return False
    if number % 2 == 0:
        return number == 2

    divisor = 3
    while divisor * divisor <= number:
        if number % divisor == 0:
            return False
        divisor += 2

    return True