A set of tiles numbered $1$ through $100$ is modified repeatedly by the following operation: remove all tiles numbered with a perfect square, and renumber the remaining tiles consecutively starting with $1$. Find the number of times the operation must be performed to reduce the number of tiles in the set to one.

Let's think step by step and output the final answer within \boxed{}.
user