#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>

using namespace std;

const int maxn = 50000 + 50;

int n;
int x;
int y;
int r;

int ans = 0;

struct T
{
	int x;
	int y;
	int r;
	int l;
	bool operator < (const T &a)const
	{
		if(x == a.x)
		{
			return y < a.y;
		}
		else
		{
			return x < a.x;
		}
	}
}A[maxn];

int main()
{
	freopen("stampede.in","r",stdin);
	freopen("stampede.out","w",stdout);
	scanf("%d",&n);
	for(int i = 1;i <= n ;i ++)
	{
		scanf("%d%d%d",&A[i].x,&A[i].y,&A[i].r);
		A[i].l = abs(A[i].x);
		
	}
	sort(A + 1,A + 1 + n);
	for(int i = 1;i <= n ;i ++)
	{
		if(A[i].y > A[i + 1].y)
		{
			if(A[i].l * A[i + 1].r == A[i + 1].l * A[i].r)
			{
				ans ++;
			}
		}
	}
	cout<<n - ans;
	return 0;
}