Question 9
The number $\sqrt{2}$ is on the computer screen. In one step, Juku can multiply the number currently on the screen by any positive rational number or add any natural number to it. Is there a positive integer $n$ such that every number that Juku can get after a finite number of steps can be obtained by at most $n$ steps? If so, find the least suitable $n$.