Fibonacci Prime Numbers

In this problem, you are given a single integer n. Your task is to generate the first n prime Fibonacci numbers. A Fibonacci prime is a Fibonacci number that is a prime number. The Fibonacci sequence is defined as follows:

\(F(0)=0,\ F(1)=1,\) and for \(n \ge 2,\ F(n)=F(n-1)+F(n-2)\).

Note that if n is less than or equal to zero, no numbers should be printed.

Your program should read input from stdin and output the result to stdout.

inputFormat

The input consists of a single line containing an integer (n), the number of Fibonacci prime numbers to output.

outputFormat

Output the first (n) Fibonacci prime numbers in order, separated by a single space. If (n \leq 0), output nothing.## sample

0