Description

There is a rectangular grid of size 2×n, to be fully tiled using 1×2 dominoes. For example, when n=3, the tiling method is illustrated in the following figure:

Write a program that, for any given n (n>0), outputs the total number of tiling methods.

Input Format

A positive integer n, where 0 < n <= 45.

Output Format

A total of n lines, sequentially outputting the total number of tiling methods for each case from 1 to n, as shown in the sample output.

```input1 4 ``` ```output1 x[1]=1 x[2]=2 x[3]=3 x[4]=5 ``` ```markdown ## Source

CodesOnline

The translation maintains the original markdown heading format (`##`) and the single line of text "CodesOnline" exactly as it appears in the source. No additional changes were made to preserve the integrity of the original formatting.