Two n One

Very Addictive Gameplay.Delete all the
numbers from the grid in minimum number of moves.n
One move is defined as follows:n
-Choose any 2 numbers, say X and Y, from the given grid such that X != Y (X not equal to Y), and remove them,orn
-Choose any 1 number, say X, from the grid, and remove it.
Do it as fast as you can.Is it easy? Lets see!