시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 (추가 시간 없음) 256 MB0000.000%

## 문제

There are two inhabitants in the Faraway Kingdom: Alyonushka the Peasant and Ivanushka the King. Alyonushka works on a farm, and Ivanushka makes laws.

Alyonushka has $x$ coins. Each day, Alyonushka gets one more coin from the treasury for her work. The amount of coins in the treasury can be considered infinite.

If the number of Alyonushka's coins divides evenly by two, Ivanushka can make another peasant law, and Alyonushka will be allowed to keep only half of her coins: the other half immediately goes to the treasury. If the number of Alyonushka's coins divides evenly by three, Ivanushka can make another farm law, and Alyonushka will be allowed to keep only one third of her coins: the other two thirds immediately go to the treasury. Ivanushka can make new laws at any moment, in any order, and do it any number of times.

Today Ivanushka got angry with Alyonushka. Now he wishes Alyonushka to have only one coin left. What is the minimum possible number of days required to achieve that?

## 입력

The first line of input contains an integer $x$: the initial number of Alyonushka's coins ($1 \le x \le 10^{9}$).

## 출력

On the first line, print $t$: the minimum possible number of days required for Ivanushka to leave Alyonushka with only one coin. On the second line, print a sequence of integers: any possible sequence of events which takes $t$ days and transforms $x$ coins into $1$. The sequence must start with $x$ and end with $1$. Every two consecutive numbers $u$ and $v$ in the sequence must satisfy either $v = u + 1$ (a day has passed), $v = u / 2$ (a new peasant law has been made), or $v = u / 3$ (a new farm law has been made).

## 예제 입력 1

11


## 예제 출력 1

1
11 12 6 2 1


## 예제 입력 2

100


## 예제 출력 2

2
100 50 25 26 27 9 3 1


## 예제 입력 3

1


## 예제 출력 3

0
1