#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
struct punct
{
    int x,y,nr;
};

const double eps=1.e-14;
bool cmp1(punct a,punct b)
{
    return ((double)a.y/(double)a.x)-((double)b.y/(double)b.x)<=-eps;
}

bool cmp2(punct a,punct b)
{
    return ((double)a.y/(double)a.x)-((double)b.y/(double)b.x)>=eps;
}

punct v1[200001],v2[200001],v3[200001],v4[200001];
int t1[200001],t2[200001];
int main()
{
    freopen("rays.in","r",stdin);
    freopen("rays.out","w",stdout);
    int n,i,x,y1,y2,nr1=0,nr2=0;
    scanf("%d",&n);
    for(i=1;i<=n;++i)
    {
        scanf("%d%d%d",&x,&y1,&y2);
        if(x>0)
        {
            nr1++;
            v1[nr1].x=v2[nr1].x=x;
            if(y1<=y2)
            {
                v1[nr1].y=y1;
                v2[nr1].y=y2;
            }
            else
            {
                v1[nr1].y=y2;
                v1[nr1].y=y1;
            }
        }
        else
        {
            nr2++;
            v3[nr2].x=v4[nr2].x=x;
            if(y1<=y2)
            {
                v3[nr2].y=y1;
                v4[nr2].y=y2;
            }
            else
            {
                v3[nr2].y=y2;
                v4[nr2].y=y1;
            }
        }
    }
    sort(v1+1,v1+nr1+1,cmp1);
    sort(v2+1,v2+nr1+1,cmp1);
    sort(v3+1,v3+nr2+1,cmp2);
    sort(v4+1,v4+nr2+1,cmp2);
    int poz=1;
    int sol=0;
    for(i=1;i<=nr1;++i)
    {
        t1[v2[i].nr]=i;
    }
    for(i=1;i<=nr2;++i)
    {
        t2[v4[i].nr]=i;
    }
    for(i=1;i<=nr1;++i)
    {
        if(t1[v1[i].nr]>=poz)
            sol++;
        while(poz<=nr1&&(double)v1[i].y/(double)v1[i].x-(double)v2[poz].y/(double)v2[poz].x<eps)
        {
            poz++;
        }
    }
    poz=1;
    for(i=1;i<=nr2;++i)
    {
        if(t2[v3[i].nr]>=poz)
            sol++;
        while(poz<=nr2&&(double)v3[i].y/(double)v3[i].x-(double)v4[poz].y/(double)v4[poz].x<eps)
        {
            poz++;
        }
    }
    printf("%d\n",sol);
    return 0;
}