#include <iostream>
#include <algorithm>
#include <fstream>
#include <math.h>
using namespace std;
typedef long long lld;
struct Triangle
{
    lld eaq,other;
};
struct Point
{
    lld x,y;
};
Triangle tri[100002];
lld eabs(lld a)
{
    if (a<0) return a*-1;
    else return a;
}
lld LengthOf (Point a,Point b)
{
    return ((a.y - b.y)*(a.y - b.y) + (a.x - b.x)*(a.x - b.x));
}
bool success(Triangle a,Triangle b)
{
    return (a.eaq*b.other==b.eaq*a.other);
}
bool sh(Triangle a,Triangle b)
{
    return ((a.eaq*b.other)<(b.eaq*a.other));
}
lld rat(Triangle a,Triangle b)
{
    return ((a.eaq*b.other)==(b.eaq*a.other));
}
int main ()
{
    freopen("tri.in","r",stdin);
    freopen("tri.out","w",stdout);
    lld i,j,n,len=0;

    Point a,b,c;
    lld ab,ac,bc,ans=1,gen=0;
    scanf("%lld",&n);
    for (i=1;i<=n;i++)
    {
        scanf("%lld %lld %lld %lld %lld %lld",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y);
        ab=LengthOf(a,b);
        ac=LengthOf(a,c);
        bc=LengthOf(b,c);

     //   cout<<ab<<" "<<ac<<" "<<bc<<endl;
        if (ab==ac)
        {
            len++;
            tri[len].eaq=ab;
            tri[len].other=bc;
        }
        else if (ab==bc)
        {
            len++;
            tri[len].eaq=ab;
            tri[len].other=ac;
        }
        else if (ac==bc)
        {
            len++;
            tri[len].eaq=ac;
            tri[len].other=ab;
        }
    }
    sort(tri+1,tri+len+1,sh);
    for (i=2;i<=len;i++)
    {
        if (ans>gen) gen=ans;
        if (rat(tri[i],tri[i-1])) ans++;
        else ans=0;
    }
    printf("%lld\n",ans);
}