CF1389F.Bicolored Segments

You are given $n$ segments $[l_1, r_1], [l_2, r_2], \dots, [l_n, r_n]$. Each segment has one of two colors: the $i$-th segment's color is $t_i$.

Let's call a pair of segments $i$ and $j$ bad if the following two conditions are met:

• $t_i \ne t_j$;
• the segments $[l_i, r_i]$ and $[l_j, r_j]$ intersect, embed or touch, i. e. there exists an integer $x$ such that $x \in [l_i, r_i]$ and $x \in [l_j, r_j]$.

Calculate the maximum number of segments that can be selected from the given ones, so that there is no bad pair among the selected ones.

给你 $n$ 条线段 $[l_1, r_1], [l_2, r_2], \dots, [l_n, r_n]$。每条线段具有两种颜色之一：第 $i$ 条线段的颜色为 $t_i$。

若满足以下两个条件，则称一对线段 $i$ 和 $j$ 为坏对：

• $t_i \ne t_j$；
• 线段 $[l_i, r_i]$ 与 $[l_j, r_j]$ 相交、嵌套或相接，即存在某个整数 $x$，使得 $x \in [l_i, r_i]$ 且 $x \in [l_j, r_j]$。

请计算：从给定的线段中最多能选出多少条线段，使得其中不存在任何坏对。

The first line contains a single integer $n$ ($1 \le n \le 2 \cdot 10^5$) — number of segments.

The next $n$ lines contains three integers $l_i, r_i, t_i$ ($1 \le l_i \le r_i \le 10^9; t_i \in {1, 2}$) — description of the $i$-th segment.

第一行包含一个整数 $n$（$1 \le n \le 2 \cdot 10^5$）——线段的数量。

接下来的 $n$ 行每行包含三个整数 $l_i, r_i, t_i$（$1 \le l_i \le r_i \le 10^9$；$t_i \in \{1, 2\}$）——第 $i$ 条线段的描述。

Print the maximum number of segments that can be selected, so that there is no bad pair among the selected segments.

输出可选择的线段的最大数量，使得所选线段中不存在坏对。