You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Background

Description

斐波那契数列（输入正整数n[3<=n<=50]，计算出n个斐波那契数列，并倒序输出）

斐波那契数列：0,1,1,2,3,5,8,13,21... ...

输入n，求数列的前n项（包含n）并按从大到小的顺序输出。

Format

Input

Output

Samples

30

514229 317811 196418 121393 75025 46368 28657 17711 10946 6765 4181 2584 1597 987 610 377 233 144 89 55 34 21 13 8 5 3 2 1 1 0

20

4181 2584 1597 987 610 377 233 144 89 55 34 21 13 8 5 3 2 1 1 0

5

3 2 1 1 0

Limitation

1s, 1024KiB for each test case.