Please reason step by step, and put your final answer within \boxed{}.
On a board, all natural numbers from 1 to 50 inclusive are written. Vasya chooses a pair of numbers on the board whose greatest common divisor is greater than one and erases one of them. What is the minimum number of numbers that Vasya can leave with these actions?
user