#include<stdio.h>
#include<algorithm>
using namespace std;
struct jap
{
    double x,y;
    bool c;
}v[200005];
bool cmp(jap a,jap b)
{
   if(a.c!=b.c)
   return a.c<b.c;
   if(a.c==0)
    return a.y<b.y;
    return a.y>b.y;
}
int main()
{
    freopen("rays.in","r",stdin);
    freopen("rays.out","w",stdout);
    int n,i,nr,dr;
    double x1,y2,y1,j;
    bool t;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%lf%lf%lf",&x1,&y1,&y2);
            v[i].x=y1/x1;
        v[i].y=y2/x1;
        if(x1>0)
        v[i].c=0;
        else
        {
            v[i].x=v[i].x*-1;
            v[i].y=v[i].y*-1;
        v[i].c=1;
        }
        if(v[i].x>v[i].y)
        {
            j=v[i].x;
            v[i].x=v[i].y;
            v[i].y=j;
        }
    }
    stable_sort(v+1,v+n+1,cmp);
    nr=1;
    dr=v[1].y;
    t=v[1].c;
    for(i=2;i<=n;i++)
    {
    if(v[i].x>dr || v[i].c!=t)
    {
        nr++;
        dr=v[i].y;
        t=v[i].c;
    }
    }
    printf("%d\n",nr);
    return 0;
}