At the foot of Liyushan Mountain, $n$ tents will be carefully arranged to provide accommodation for those who are willing to experience the joy of approaching nature, the tranquility of the night, and the bright starry sky.
The $i$-th tent is located at the point of $(x_i, y_i)$ and has a weight of $w_i$. A tent is important if and only if both $x_i$ and $y_i$ are even. You need to remove some tents such that for each remaining important tent $(x, y)$, there do not exist $3$ other tents $(x'_1, y'_1)$, $(x'_2, y'_2)$ and $(x'_3, y'_3)$ such that both conditions are true:
$|x'_j-x|, |y'_j - y|\leq 1$for all$j \in \{1, 2, 3\}$, and- these four tents form a parallelogram (or a rectangle) and one of its sides is parallel to the
$x$-axis.
Please maximize the sum of the weights of the tents that are not removed. Print the maximum value.
Input
The first line contains a single integer $n$ ($1\leq n\leq 1\,000$), representing the number of tents.
Each of the next $n$ lines contains three integers $x_i$, $y_i$ and $w_i$ ($-10^9\leq x_i,y_i \leq 10^9$, $1\leq w_i\leq 10^9$), representing the coordinate of the $i$-th tent and its weight. No two tents are located at the same point.
Output
A single integer — the maximum sum of the weights of the remaining tents.
Note
Here is an illustration of the second example. Black triangles indicate the important tents. This example also indicates all $8$ forbidden patterns.
样例
5
0 0 4
0 1 5
1 0 3
1 1 1
-1 1 2
12
32
2 2 1
2 3 1
3 2 1
3 3 1
2 6 1
2 5 1
3 6 1
3 5 1
2 8 1
2 9 1
1 8 1
1 9 1
2 12 1
2 11 1
1 12 1
1 11 1
6 2 1
7 2 1
6 3 1
5 3 1
6 6 1
7 6 1
5 5 1
6 5 1
6 8 1
5 8 1
6 9 1
7 9 1
6 12 1
5 12 1
6 11 1
7 11 1
24
题面与样例版权归 Codeforces 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。