Fibonacci Sequence up to N

Given an integer N, your task is to print all Fibonacci sequence numbers that are less than N. The Fibonacci sequence is defined as follows:

\( F_0 = 0,\ F_1 = 1,\ F_n = F_{n-1} + F_{n-2} \) for \( n \ge 2 \).

For example, when N = 10, the Fibonacci numbers less than 10 are 0 1 1 2 3 5 8.

inputFormat

The input consists of a single line containing an integer N (\(1 \le N \le 10^{18}\)).

outputFormat

Output a single line containing the Fibonacci sequence numbers less than N, separated by a single space.

10

0 1 1 2 3 5 8