minimum moves to be made to get out of convex hull

Given a convex hull in $XY$ plane. and we have $n$ points sitting inside it. In one move we can move all the points to right by $1$ or move all the points to up by $1$. what are the minimum number of moves that are required to get all the points outside the convex hull?