def newman_prime(n):
    # NSW primes are defined by the sequence:
    # S(0) = 1, S(1) = 1, S(n) = 2*S(n-1) + S(n-2)
    # NSW primes are values in this sequence that are prime
    
    if n == 0:
        return 1
    
    count = 0
    a, b = 1, 1  # S(0), S(1)
    
    # Check each term in the NSW sequence
    index = 0
    while True:
        # Current term is b (S(index+1))
        candidate = b
        
        if is_prime(candidate):
            if count == n:
                return candidate
            count += 1
        
        a, b = b, 2 * b + a
        index += 1

def is_prime(num):
    if num < 2:
        return False
    if num == 2:
        return True
    if num % 2 == 0:
        return False
    for i in range(3, int(num**0.5) + 1, 2):
        if num % i == 0:
            return False
    return True