The Collatz Conjecture

Problem Description

The so-called Collatz conjecture says that, for any positive integer: if it is odd, multiply it by 3 and add 1; if it is even, divide it by 2; then repeat the same rule on the result, and eventually you will always reach 1. For example, taking the initial integer 5, the process goes 16, 8, 4, 2, 1. Your program should read an integer and print out the whole process by which it is reduced to 1.

Input Format

A positive integer $N(N\le 2,000,000)$.

Output Format

Print the steps from the input integer down to 1, one step per line, with each line describing the computation. The last line outputs End. If the input is 1, output End directly.

Sample Input

5

Sample Output

5*3+1=16
16/2=8
8/2=4
4/2=2
2/2=1
End