Absolute Value · Superchallenge problem

Four houses stand along a straight street at the points $-9$, $-2$, $3$ and $10$. A mailbox will be put at an integer point $P$ so that the total of the distances from $P$ to the four houses is as small as possible. How many different integer points $P$ give that smallest total?