------
## 最终结论
```python
def prime_fib(n: int):
    def is_prime(num: int) -> bool:
        if num <= 1:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    def fibonacci_sequence(limit: int):
        fibs = [0, 1]
        while len(fibs) < limit:
            fibs.append(fibs[-1] + fibs[-2])
        return fibs

    primes_fib = []
    limit = 100  # Arbitrary limit to generate Fibonacci numbers
    fibs = fibonacci_sequence(limit)

    for fib in fibs:
        if is_prime(fib):
            primes_fib.append(fib)

    return primes_fib[n-1]
```