import std;

void main() {
    int N;
    readf("%d\n", N);

    auto red = new RedBlackTree!int();
    int[] blue;
    foreach (i; 0 .. N) {
        int A, B, T;
        readf("%d %d %d\n", A, B, T);

        if (A == 0) {
            red.insert(B-T);
        }
        else {
            blue ~= B - T;
        }
    }

    ulong res;
    foreach (b; blue) {
        res += red.equalRange(b).array.length;
    }

    res.writeln;
}