2013 December Contest, Bronze Problem 1. Record Keeping

#include<bits/stdc++.h>
using namespace std;
#define Mx 101
map<string,int>m;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    //freopen("records.in","r",stdin);
    //freopen("records.out","w",stdout);
    vector<string>V(3);
    int n;
    cin >> n;
    string str;
    for(int i=0;i<n;i++)
    {
        cin >> V[0] >> V[1] >> V[2];
        sort(V.begin(),V.end());
        str= V[0]+V[1]+V[2];
        m[str]++;
    }
    int mx = 0;
    for(auto x : m)
    {
         mx = max(mx,x.second);
    }
    cout << mx << endl;
    return 0;
}