The Coordinate Plane · Superchallenge problem

A robot starts at $(10, 10)$ and makes exactly $6$ moves. Each move is $1$ unit left, right, up or down (it may go back over places it has already been). How many different points could the robot end at?