h4

#include <iostream>
#include <algorithm>
#include <map>
#define NMAX 100001
using namespace std;
string arr[NMAX];
int n;

int largestAnagramSet(string arr[],int n)
{
    int maxSize=0;
    map<vector<int>,int> countc;

    for (int i=0;i<n;++i)
    {
        vector<int> freq(26);

        for(char ch:arr[i])
            freq[ch-'a']+=1;
        countc[freq]+=1;
        maxSize=max(maxSize,countc[freq]);
    }
    return maxSize;
}

int main()
{
    while(cin>>arr[n++])
        cin.get();
    cout<<largestAnagramSet(arr,n);
    return 0;
}