```python
import math

def newman_prime(n):
    """
    Finds the nth Newman–Shanks–Williams (NSW) prime number.
    """
    def is_prime(num):
        if num <= 1:
            return False
        if num == 2:
            return True
        if num % 2 == 0:
            return False
        for i in range(3, int(math.sqrt(num)) + 1, 2):
            if num % i == 0:
                return False
        return True

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

    count = 0
    s_prev = 1  # S(0)
    s_curr = 1  # S(1)

    while count < n:
        s_next = 2 * s_curr + s_prev
        s_prev, s_curr = s_curr, s_next

        if is_prime(s_curr):
            count += 1
    
    return s_curr
```