sicily 1006

//就开始的时候读不懂题目，感觉就是简单的排列就可以，但是参考了别人的才清楚，原来是要求字符串ABCDE的所有排列
//与题目给出的排列进行比较，找出间距最小的差距值！用到stl中的next_permutation（）函数就简单好多了！
#include "iostream"
#include "string"
#include "map"
#include "algorithm"
using namespace std;
int countvalue(string temp);
map<char, int> m;
int main()
{
	int n;
	while (cin >> n && n != 0)
	{
		string str = "ABCDE";
		int count = 1000000000;
		string *s = new string[n];
		for (int i = 0; i < n; i++)
			cin >> s[i];
		string temp;
		do
		{
			for (int i = 0; i < 5; i++)
				m[str[i]] = i;
			int sum = 0;
			for (int i = 0; i < n; i++)
				sum += countvalue(s[i]);
			if (count > sum)
			{
				count = sum;
				temp = str;
			}
		}while (next_permutation(str.begin(), str.begin()+5));//生成字符串ABCDE的所有排列，但是要求原始的字符串是从小到大排列开始！生成成功就返回true
		cout << temp << " is the median ranking with value " << count << "." << endl;
	}
}

int countvalue(string temp)//计算其差距值！
{
	int sum = 0;
	for (int i = 0; i < 4; i++)
		for (int j = i + 1; j < 5; j++)
			if (m[temp[i]] > m[temp[j]])
				sum++;
	return sum;
}