```python
def newman_prime(n):
    
    def is_prime(num):
        if num <= 1:
            return False
        if num == 2:
            return True
        if num % 2 == 0:
            return False
        
        i = 3
        while i * i <= num:
            if num % i == 0:
                return False
            i += 2
        return True

    primes_found = 0
    s_prev = 1
    s_curr = 1
    
    while True:
        s_next = 2 * s_curr + s_prev
        s_prev, s_curr = s_curr, s_next
        
        if is_prime(s_curr):
            primes_found += 1
            if primes_found == n:
                return s_curr
```