1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#pragma GCC optimize("O3")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

#define BOOST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define FOR(a, b, c) for(int a = b; a < c; ++a)
#define PB push_back
#define MP make_pair
#define INF (int)1e9+7
#define LLINF 2e18+7
#define ALL(a) a.begin(), a.end()
#define SIZE(a) (int)a.size()

typedef unsigned long long ULL;
typedef long long LL;
typedef long double LD;

using namespace std;

//#define DEBUG

int main()
{
    #ifndef DEBUG
    BOOST;
    #endif

    LL n;
    cin >> n;

    int res1 = 0;
    int res2 = 0;

    map <int, int> right, up;
    set <int> times;

    FOR(i, 0, n)
    {
        int r, w, t;

        cin >> r >> w >> t;

        if(r == 1)
        {
            right[t - w]++;
        }
        else
        {
            up[t - w]++;
        }

        times.insert(t - w);
    }

    int res = 0;

    for(auto& t : times)
    {
        int a = right[t];
        int b = up[t];

        res += max(a, b);
    }

    cout << n - res << "\n";

    return 0;
}