Fibonacci Tree Level

Given an integer n, you need to generate the list of node labels at level n of a special Fibonacci tree. The labeling of the nodes is defined as follows:

• For n = 0 and n = 1, the level always contains just a single node with label 1.
• For n ≥ 2, for each integer i from 2 to n, the tree generates two nodes: the left child with label \(F(i-1)\) and the right child with label \(F(i-2)\), where \(F(k)\) is the k-th Fibonacci number defined by:

\( F(0)=0, \quad F(1)=1, \quad F(k)=F(k-1)+F(k-2) \quad \text{for } k \ge 2 \).

Your task is to compute and output the labels of the nodes at level n from left to right, separated by a single space.

inputFormat

The input consists of a single integer n (0 ≤ n ≤ 20) provided via standard input.

outputFormat

Print the labels of the nodes at level n in order, separated by a single space. There should be no extra spaces at the beginning or end of the output.

0

1