Blocked Path

Find the number of the different shortest paths from point A to point B in a city with perfectly horizontal streets and vertical avenues as shown in the figure below. No path can cross the fenced off area shown in black in the figure.

The Answer is an integer. Just put the number without any decimal places.