#include<bits/stdc++.h>
using namespace std;

int main() {
    long long N, A, B, T, ans = 0;
    map<int, int>ma;
    vector<int>Xpoints;
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> A >> B >> T;
        if (A == 0) {
            if (ma.count(B - T))ma[B + T]++;
            else ma[B - T] = 1;
        }
        else Xpoints.push_back(B - T);
    }
    for (int t : Xpoints) {
        if (ma.count(t))ans += ma[t];
    }
    cout << ans << endl;
}