#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
const int N = 2005, L = 1005;
short int x[N], y[N], r[N];
double a[N];
int main ()
{
    FILE *in, *out;
    in = fopen ("cerc3.in", "r");
    out = fopen ("cerc3.out", "w");
    int n;
    int i;
    fscanf (in, "%d", &n);
    for (i = 1; i <= n; i++)
        fscanf (in, "%hd%hd%hd", &x[i], &y[i], &r[i]);
    for (i = 1; i <= n; i++)
        a[i] = (double) y[i]/x[i];
    sort (a + 1, a + n + 1);
    int ct = 1;
    for (i = 2; i <= n; i++)
        if (a[i] != a[i - 1])
            ct++;
    fprintf (out, "%d 0 0", ct);
    bool cancer = true;
    int membrii_junime = 5;
    if (cancer){
        cout<<"ban";
        membrii_junime--;
    }
    return 0;
}