VTMO 2016 — Grade 3 — semifinal Question 3

Minh has five stacks of books as shown. He must make all stacks equally high without changing the number of stacks. What is the fewest moves, if each move transfers one or two books?