#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
using namespace std;

#define FOR(i,n) for (int i = 0; i < n; i++)
#define abs(x) ((x)<0?(-(x)):(x))
#define REP(i,v) for (unsigned i = 0; i < v.size(); i++)
#define RL(i,v) for (unsigned i = 0; i < v.length(); i++)
#define foreach(var, container) for (typeof((container).begin()) var = (container).begin(); var != (container).end(); ++var)
typedef long long ll;

ll gcd(ll n,ll m){return m==0?n:gcd(m,n%m);}

ll lenSquared(int ax, int ay, int bx, int by) {
    ll x = ax-bx;
    ll y = ay-by;
    //cout<<"mul"<<x<<" "<<y<<endl;
    return x*x+y*y;
}

int main()
{
#ifdef __LOCAL__
	freopen("input.in", "r", stdin);
#else
	freopen("tri.in", "r", stdin);
 	freopen("tri.out", "w", stdout);
#endif
    int N;
    cin>>N;
    int ai,aj,bi,bj,ci,cj;
    map<ll,ll> areas;
    for(int i=0;i<N;i++) {
        cin>>ai>>aj>>bi>>bj>>ci>>cj;
        ll a = lenSquared(ai,aj,bi,bj);
        ll b = lenSquared(bi,bj,ci,cj);
        ll c = lenSquared(ci,cj,ai,aj);
        //cout<<a<<" "<<b<<" "<<c<<endl;
        if(a!=b && b!=c && a!=c)continue;
        double ar = sqrt(a);double br = sqrt(b);double cr = sqrt(c);
        double p = (ar+br+cr)/2;
        double area = sqrt(p*(p-ar)*(p-br)*(p-cr));
        //cout<<"ar "<<area<<" "<<p<<" abcr"<<ar<<" "<<br<<" "<<cr<<endl;
        ll a2 = lround(area*2);
        double equal = ar;
        double nonEqual = cr;
        if(a==c) {equal = ar;nonEqual = br;}
        else if(b==c) {equal = br;nonEqual = ar;}
        //cout<<(equal/nonEqual)*20000<<" "<<a2<<endl;
        areas[lround((equal/nonEqual)*200000)] ++;
    }
    ll best = 0;
    foreach(it,areas) {
        if(it->second > best) {
            best=it->second;
        }
    }
    cout<<best;
    //if(best%2==1)cout<<".5";
    cout<<endl;
    return 0;
}