#include <fstream>
#include <queue>
#include <cmath>
#include <algorithm>
#define VAL 200005
#define CONST 57.295779

using namespace std;

ifstream fin("rays.in");
ofstream fout("rays.out");

struct eveniment
{
    long double nr;
    int inter;
    char semn;
};

eveniment EV[2*VAL], EV2[2*VAL];

int N, M1, M2, i, j, st[VAL], top;
int X[VAL], Y1[VAL], Y2[VAL], ANS;
long double A, B;
bool ok[VAL];

void Unghi(long double &U, long long X, long long Y)
{
    U=atan2(Y, X)*CONST;
    U+=90;
    if (U>=360)
        U-=360;
}

struct cmp
{
    bool operator () (eveniment A, eveniment B)
    {
        if (A.nr!=B.nr)
            return A.nr<B.nr+0.00000000000000001;
        if (A.semn=='+')
            return true;
        return false;
    }
};

int main()
{
    fin >> N;
    for (i=1; i<=N; i++)
    {
        fin >> X[i] >> Y1[i] >> Y2[i];
        Unghi(A, X[i], Y1[i]);
        Unghi(B, X[i], Y2[i]);
        if (A>B)
            swap(A, B);
        if (X[i]<0)
        {
            EV[++M1].nr=A;
            EV[M1].semn='+';
            EV[M1].inter=i;
            EV[++M1].nr=B;
            EV[M1].semn='-';
            EV[M1].inter=i;
        }
        else
        {
            EV2[++M2].nr=A;
            EV2[M2].semn='+';
            EV2[M2].inter=i;
            EV2[++M2].nr=B;
            EV2[M2].semn='-';
            EV2[M2].inter=i;
        }
    }
    sort(EV+1, EV+M1+1, cmp());
    sort(EV2+1, EV2+M2+1, cmp());
    for (i=1; i<=M1; i++)
    {
        if (EV[i].semn=='+')
            st[++top]=EV[i].inter;
        else
        {
            if (ok[EV[i].inter]==false)
            {
                ANS++;
                while (top>0)
                {
                    ok[st[top]]=true;
                    top--;
                }
            }
        }
    }
    for (i=1; i<=M2; i++)
    {
        if (EV2[i].semn=='+')
            st[++top]=EV2[i].inter;
        else
        {
            if (ok[EV2[i].inter]==false)
            {
                ANS++;
                while (top>0)
                {
                    ok[st[top]]=true;
                    top--;
                }
            }
        }
    }
    fout << ANS;
    fin.close();
    fout.close();
    return 0;
}