Line Plots · Superchallenge problem

A line plot looks like a staircase: above $1, 2, 3, 4, 5$ there are $1, 2, 3, 4, 5$ X's. In one move you may slide a single X one step left or right. What is the fewest moves needed so that every one of the five numbers has exactly $3$ X's?