#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
const double PI=2.0*acos(0.0);
const double eps=4e-15;
double unghi(int x, int y)
{
    double rad=1.0*atan2(1.0*y,1.0*x);
   // if(rad<0) rad+=2 * PI;
    return rad * 180 / PI;
}
struct mem
{
    double unghi;
    bool tip;
    int ind;
};
vector<mem>v;
vector<int>ans;
int poz[200005];
bool cmp(mem a, mem b)
{
    if(fabs(a.unghi-b.unghi)<eps) return a.tip>b.tip;
    return a.unghi-b.unghi<-eps;
}
int main()
{
    freopen("rays.in","r",stdin);
    freopen("rays.out","w",stdout);
    int n,x,y1,y2,cnt=0,cnta=0,act=0;;
    double u1,u2;
    scanf("%d",&n);
    mem temp1,temp2;
    temp1.tip=1;
    temp2.tip=0;
    for(register int i=1;i<=n;i++)
    {
        scanf("%d%d%d",&x,&y1,&y2);
        temp1.unghi=unghi(x,y1);
        temp2.unghi=unghi(x,y2);
        if(temp2.unghi-temp1.unghi<-eps) swap(temp1.unghi,temp2.unghi);
        temp1.ind=temp2.ind=i;
        v.push_back(temp1);
        v.push_back(temp2);
    }
    sort(v.begin(),v.end(),cmp);
    for(register int i=0;i<v.size();i++)
    {
        if(v[i].tip==1) cnt++;
            else if(poz[v[i].ind]>act) cnt--;
        poz[v[i].ind]=act+1;
        if(cnt<cnta)
        {
            ans.push_back(cnta);
            act++;
            cnt=0;
        }
        cnta=cnt;
    }
    printf("%d",ans.size());
    return 0;
}