Strange Grid

On a strange grid, every move to an adjacent cell costs health. Moving from $(x, y)$ to $(x - 1, y)$ costs $A$, to $(x + 1, y)$ costs $B$, to $(x, y - 1)$ costs $C$, and to $(x, y + 1)$ costs $D$.

$N$ people are scattered across the grid. What is the minimum total health they must spend to gather at a single point?

The first line contains $N$, $A$, $B$, $C$, $D$ in that order. ($1 \le N \le 200\,000$, $0 \le A, B, C, D \le 10^6$)

From the second line, $N$ lines follow, each with the integer coordinates $X_i$, $Y_i$ of one person on the grid, in order. ($-10^6 \le X_i, Y_i \le 10^6$)

All numbers in the input are integers.

Print the answer on the first line.