write a go solution for Description:
You are given n segments [l_1,r_1],[l_2,r_2],...,[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_inet_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 xin[l_i,r_i] and xin[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.

Input Format:
The first line contains a single integer n (1<=n<=2*10^5) — number of segments.

The next n lines contains three integers l_i,r_i,t_i (1<=l_i<=r_i<=10^9;t_iin1,2) — description of the i-th segment.

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

Note:
None. Output only the code with no comments, explanation, or additional text.