The Coordinate Plane · Superchallenge problem

A grasshopper starts at $(0, 0)$. Each hop is either "$1$ right and $2$ up" or "$2$ right and $1$ up". It wants to land exactly on $(9, 9)$. In how many different orders of hops can it do this?