- Time limit: 1.00 s
- Memory limit: 512 MB
\[ 3 \rightarrow 10 \rightarrow 5 \rightarrow 16 \rightarrow 8 \rightarrow 4 \rightarrow 2 \rightarrow 1\]
Your task is to simulate the execution of the algorithm for a given value of $n$.
Input
The only input line contains an integer $n$.
Output
Print a line that contains all values of $n$ during the algorithm.
Constraints
- $1 \le n \le 10^6$
Input:
3
Output:
3 10 5 16 8 4 2 1