#include <iostream>

#include <cstdio>

#include <cstring>

#include <cstdlib>

#include <cmath>

#include <vector>

#include <queue>

#include <stack>

#include <map>

#include <algorithm>

#include <set>

using namespace std;

typedef long long ll;

typedef unsigned long long Ull;

#define MM(a,b) memset(a,b,sizeof(a));

const double eps = 1e-10;

const int  inf =0x7f7f7f7f;

const double pi=acos(-);

const int maxn=+;

char s[];

int Hash[];

int BKDRHash(char* s)

{

     long long seed=;

     long long hashv=;

     while(*s=='0')s++;

     while(*s)

     {

         hashv=hashv*seed+(*s++);

     }

     return (hashv & 0x7FFFFFFF);

}

int main()

{

    int n;

    while(~scanf("%d",&n))

    {

        for(int i=;i<=n;i++)

             {

                 scanf("%s",s);

                 Hash[i]=BKDRHash(s);

             }

        sort(Hash+,Hash+n+);

        int ans=,tmp=;

        for(int i=;i<=n;i++)

        {

            if(Hash[i]==Hash[i-]) tmp++;

            else tmp=;

            ans=max(ans,tmp);

        }

        printf("%d\n",ans);

    }

    return;

}