Expensive Steps

There is an $N\times N$ grid, with rows numbered $1$ to $N$ from top to bottom and columns numbered $1$ to $N$ from left to right. The cell at the intersection of the $i$-th row and $j$-th column is denoted $(i, j)$. Chef is standing at position $(x_1, y_1)$ of this grid. He wants to reach position $(x_2, y_2)$. To achieve this, he can take either horizontal or vertical steps. That is, from cell