Chef Removes Stones

Chef has placed $n$ stones on a 2D plane at distinct integer coordinates. Each stone occupies a unique position defined by coordinates $(x, y)$. \ Chef wants to remove as many stones as possible under a strict rule: a stone can only be removed if there exists another stone in the same row or the same column that has not yet been removed. \ Help Chef determine the maximum number of stones that can