Description

Author: miyun

Consider an algorithm that takes as input a positive integer $nnn$. If $nnn$ is even, the algorithm divides it by two, and if $nnn$ is odd, the algorithm multiplies it by three and adds one. The algorithm repeats this, until $nnn$ is one. For example, the sequence for $n=3n=3n=3$ is as follows:

$$3→10→5→16→8→4→2→1 3 → 10 → 5 → 16 → 8 → 4 → 2 → 13→10→5→16→8→4→2→1$$

Your task is to simulate the execution of the algorithm for a given value of $nnn$.

Constraints

• $1≤n≤1061 ≤ n ≤ 10^61≤n≤106$

 

# Below are test area.

test bold

test italic</p>

test underline strikethrough

^super

_sub

code

• list1

• list2

Input Format

The only input line contains an integer $nnn$.

Output Format

Print a line that contains all values of $nnn$ during the algorithm.

3

3 10 5 16 8 4 2 1