In a neighborhood represented on a geometrical grid, a dog named Max wants to move from his home at point (2, 1) to visit his friend Bella's house located at point (5, 4). Max can only move in four directions: north, south, east, and west. He must follow the shortest possible path. How many different shortest paths can he take to reach Bella?