Nth Prime Fibonacci Number

You are given a positive integer n. Your task is to find the n-th prime Fibonacci number. The Fibonacci sequence is defined as:

\( F(1) = 1,\quad F(2) = 1,\quad F(n) = F(n-1) + F(n-2) \text{ for } n > 2. \)

Note that a prime number is an integer greater than 1 that has no positive divisors other than 1 and itself. The sequence of Fibonacci numbers that are prime begins as: 2, 3, 5, 13, 89, 233, 1597, ...

Your program should read an integer from the standard input and output the n-th prime Fibonacci number to the standard output.

inputFormat

The input consists of a single integer n (1 ≤ n ≤ 20), which represents the position in the sequence of prime Fibonacci numbers.

outputFormat

Output a single integer: the n-th prime Fibonacci number.

## sample

1

2

</p>