Question 25
A positive integer $n$ is written on the blackboard. In each step we replace the number by the sum of any two positive integers whose product is equal to the number on the board. Determine the smallest number that can be obtained after a finite number of steps in terms of the initial number $n$.