Downtown Delivery Routes

A delivery robot is parked at the southwest corner of a downtown district laid out as a $6 \times 6$ grid of blocks, and it must drop a package at the northeast corner. At every intersection the robot may travel one block east or one block north; heading west or south is never permitted. How many distinct routes can the robot take to its destination?