#ifdef _WIN32
#  define LL "%I64d"
#else
#  define LL "%Ld"
#endif

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <algorithm>
#include <complex>
#include <utility>
using namespace std;
#define null NULL
#define mp make_pair
#define pb(a) push_back(a)
#define sz(a) ((int)(a).size())
#define all(a) a.begin() , a.end()
#define fi first
#define se second
#define relaxMin(a , b) (a) = min((a),(b))
#define relaxMax(a , b) (a) = max((a),(b))
#define SQR(a) ((a)*(a))
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
ll gcd(ll a , ll b){
  while(b > 0){
   a %= b;
   swap(a,b);
              }
  return a;
}
map< vi , int > cnt;
int main(){
  freopen("tri.in" , "r" , stdin);
  freopen("tri.out" , "w" , stdout);
  int N;
  scanf("%d" , &N);
  for(int i=0;i<N;++i){
   int x1 , y1 , x2 , y2 , x3 , y3;
   scanf("%d%d%d%d%d%d" , &x1 , &y1 , &x2 , &y2 , &x3 , &y3);
   int s1 = SQR(x1 - x2) + SQR(y1 - y2),
       s2 = SQR(x2 - x3) + SQR(y2 - y3),
       s3 = SQR(x3 - x1) + SQR(y3 - y1);
   bool OK = false;
   if(s1 == s2 || s2 == s3 || s1 == s3)OK = true;
   if(!OK)continue;
   int G = gcd(s1 , gcd(s2 , s3));
   s1 /= G;
   s2 /= G;
   s3 /= G;
   vi L;
   L.pb(s1); L.pb(s2); L.pb(s3);
   sort(all(L));
   ++cnt[L];
                      }
  int ans = 0;
  for(map< vi , int >::iterator it = cnt.begin();it!=cnt.end();++it)
   relaxMax(ans , it->se);
  printf("%d\n" , ans);
  return 0;
}