Question 54
A positive integer $n$ is written on a board. At each step the number may be replaced by the sum of two positive integers whose product equals that number. Determine, in terms of $n$, the smallest number that can appear on the board after finitely many steps.