Pre-Algebra · Hard problem

A delivery robot in a city of square blocks can only travel along horizontal and vertical streets. It starts at $(-3,-2)$, must first pick up a package at $(1,-5)$, and then deliver it to $(4,6)$. What is the shortest total distance it can travel, in blocks?