Problem F
Ski Lifts
The only thing remaining from the old lift system are $n$ pylons situated at integer coordinates in the plane. You would like to put lifts in the form of line segments between some of these pylons. The line segments must satisfy the following constraints:

A line segment can only go between pylons $(x_1, y_1)$ and $(x_2, y_2)$ if $y_1y_2 = 1$.

There are two types of pylons, oneway and twoway pylons. The oneway pylons can be connected to at most one other pylon, and the twoway pylons can be connected to at most two other pylons. However, if a twoway pylon $i$ is connected to two other pylons, then they must be on opposite sides of $i$ in the $y$direction. In other words, the two pylons connected to $i$ must have different $y$coordinates.

Two line segments may not intersect (except that the two line segments incident on a twoway pylon may touch at their endpoints).
What is the maximum number of ski lifts (line segments) you can place under these constraints?
Input
The first line contains one integer $n$ ($1 \leq n \leq 10^5$). Each of the following $n$ lines contains three integers $x$, $y$, and $a$, the coordinates and type of a pylon ($0 \leq x,y \leq 10^5$; $a=1$ for a oneway pylon and $a=2$ for a twoway pylon). All the pylons are situated at different coordinates.
Output
Output the maximum number of ski lift line segments that can be placed.
Sample Input 1  Sample Output 1 

8 1 0 1 3 0 2 0 1 1 2 1 2 4 1 2 1 2 2 2 3 1 4 3 1 
4 
Sample Input 2  Sample Output 2 

4 0 0 1 100000 1 1 0 99999 1 100000 100000 1 
2 