Starry Night (Easy)

This problem and the Hard problem are the same problem with different input limits.

Star is taking photos of the night sky outside. Star wants to frame the best-looking photo and display it. While deciding how to pick the best photo, Star decides to score each photo as follows.

The sky at that time can be drawn as a 2D grid, and each cell is written as $(x, y)$. The sky region in a photo is always a rectangle, and no photo includes only part of a grid cell.

Given $N$ stars, where star $i$ is at $(x_i, y_i)$ with brightness $p_i$, the brightness $b_{x, y}$ at cell $(x, y)$ is computed as follows.

$b_{x, y} = \sum_{i = 1}^{N} \max(p_i - (|x - x_i| + |y - y_i|), 0)$

If the bottom-left cell of the photo's grid is $(a, b)$ and the top-right cell is $(c, d)$, the score $score$ of the photo is computed as follows.

$score = \sum_{y = b}^{d} \sum_{x = a}^{c} b_{x, y}$

Given the $N$ stars and the information about the photo, compute the score of the photo.

The first line contains the number of stars $N$. $(1 \le N \le 10\,000)$

Each of the next $N$ lines contains the position $x_i, y_i$ and brightness $p_i$ of the $i$-th star. No two stars are at the same position. $(-10\,000 \le x_i \le 10\,000;$ $-10\,000 \le y_i \le 10\,000;$ $1 \le p_i \le 2\,000)$

The last line contains $a, b, c, d$. The bottom-left cell of the photo is $(a, b)$, and the top-right cell is $(c, d)$. $(-10\,000 \le a \le c \le 10\,000;$ $-10\,000 \le b \le d \le 10\,000;$ $c - a \le 2\,000;$ $d - b \le 2\,000)$

All input values are integers.

Print the score of the photo.