Find the number of ways to place $1$s, $0$s, and $-1$s on a $4 \times 4$ grid such that any path from the upper left corner to the bottom right corner that uses the minimum number of steps has the same sum.