MYTS 2019 — Grade 7 — Round 1 Question 9

Initially each square of a $4\times4$ board contains one grasshopper. They all simultaneously jump to an adjacent square, with several permitted to land together. What is the greatest possible number of empty squares afterward?

(Two squares are adjacent if they share an edge.)