Fibonacci Primes

You are given a positive integer n. Your task is to compute the first n Fibonacci numbers that are prime numbers. Recall that the Fibonacci sequence is defined as:

\( F_0 = 0,\; F_1 = 1 \) and \( F_{k} = F_{k-1} + F_{k-2} \) for \( k \ge 2 \).

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

You need to output the required Fibonacci prime numbers in the order in which they appear in the Fibonacci sequence, separated by a single space.

inputFormat

The input consists of a single integer n (1 ≤ n ≤ 10), which denotes the number of Fibonacci prime numbers to output.

outputFormat

Output the first n Fibonacci prime numbers in a single line, separated by a space.

1

2