Problem B: Conformity

University administrators are uncomfortable with this situation, and therefore wish to offer a conformity prize to frosh who choose the most popular combination of courses. How many frosh will win the prize?

The input consists of several test cases followed by a line containing 0. Each test case begins with an integer 1 ≤ n ≤ 10000, the number of frosh. For each frosh, a line follows containing the course numbers of five distinct courses selected by the frosh. Each course number is an integer between 100 and 499.

The popularity of a combination is the number of frosh selecting exactly the same combination of courses. A combination of courses is considered most popular if no other combination has higher popularity. For each line of input, you should output a single line giving the total number of students taking some combination of courses that is most popular.

Sample Input

3
100 101 102 103 488
100 200 300 101 102
103 102 101 488 100
3
200 202 204 206 208
123 234 345 456 321
100 200 300 400 444
0

Output for Sample Input

2
3

#include <cstdio>
#include <map>
#include <algorithm>
using namespace std;

int main() {
	int n, A[5];
	char buf[20];
	while(scanf("%d", &n) == 1 && n) {
		string str;
		map<string, int> record;
		while(n--) {
			scanf("%d %d %d %d %d", &A[0], &A[1], &A[2], &A[3], &A[4]);
			sort(A, A+5);
			sprintf(buf, "%d%d%d%d%d", A[0], A[1], A[2], A[3], A[4]);
			str = buf;
			record[str]++;
		}
		int max = 0, maxNum = 0;
		for(map<string, int>::iterator i = record.begin(); i != record.end(); i++) {
			if(i->second > max)
				max = i->second, maxNum = 0;
			if(i->second == max)
				maxNum += max;
		}
		printf("%d\n", maxNum);
	}
    return 0;
}