Back to Problem List

Fibonacci

Given a number $N$ ( $\le N \le 10^6$ ), output the first $N$ terms in the Fibonacci sequence modulo $10^9+7$

Input Format

Line 1 contains the number $N$

Output Format

$N$ numbers modulo $10^9+7$

Sample Input

6

Sample Output

1 1 2 3 5 8

Submit