Colored Cubes

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>
#include <map>
#include <string>
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>
#include <ctime>
//#pragma comment(linker, "/STACK:1024000000,1024000000") 

using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::getline;
using std::make_pair;
using std::greater;
/*
生成状态
int left[6] = {1, 5, 2, 3, 0, 4};
int up[6] = {3, 1, 0, 5, 4, 2};

void rotate(int *T, int *p)
{
	int q[6];
	memcpy(q, p, sizeof(q));
	for(int i = 0; i < 6; ++i)
		p[i] = q[T[i]];
}

int main()
{
	freopen("d:\\local.txt", "w", stdout);
	int p0[6] = {0, 1, 2, 3, 4, 5};
	int p[6];
	for(int i = 0; i < 6; ++i)
	{
		memcpy(p, p0, sizeof(p));
		if(i == 0) {rotate(up, p);}
		if(i == 1) {rotate(left, p); rotate(up, p);}
		if(i == 3) {rotate(up, p); rotate(up, p); printf("up up !\n");}
		if(i == 4) {rotate(left, p); rotate(left, p); rotate(left, p), rotate(up, p);}
		if(i == 5) {rotate(left, p); rotate(left, p); rotate(up, p);}
		for(int j = 0; j < 4; ++j)
		{
			printf("{%d, %d, %d, %d, %d, %d},\n", p[0], p[1], p[2], p[3], p[4], p[5]);
			rotate(left, p);
		}
	}
}
*/

int state[24][6] = {	
						{3, 1, 0, 5, 4, 2},
						{1, 2, 0, 5, 3, 4},
						{2, 4, 0, 5, 1, 3},
						{4, 3, 0, 5, 2, 1},
						{3, 5, 1, 4, 0, 2},
						{5, 2, 1, 4, 3, 0},
						{2, 0, 1, 4, 5, 3},
						{0, 3, 1, 4, 2, 5},
						{0, 1, 2, 3, 4, 5},
						{1, 5, 2, 3, 0, 4},
						{5, 4, 2, 3, 1, 0},                                                     
						{4, 0, 2, 3, 5, 1},
						{5, 1, 3, 2, 4, 0},
						{1, 0, 3, 2, 5, 4},
						{0, 4, 3, 2, 1, 5},
						{4, 5, 3, 2, 0, 1},
						{3, 0, 4, 1, 5, 2},
						{0, 2, 4, 1, 3, 5},
						{2, 5, 4, 1, 0, 3},
						{5, 3, 4, 1, 2, 0},
						{3, 4, 5, 0, 1, 2},
						{4, 2, 5, 0, 3, 1},
						{2, 1, 5, 0, 4, 3},
						{1, 3, 5, 0, 2, 4},
					};
int rear;
char rec[24][30];

int get_num(char *p)
{
	for(int i = 0; i < rear; ++i)
		if(strcmp(rec[i], p) == 0)
			return i;
	strcpy(rec[rear], p);
	return rear++;
}

int n;
char str[30];
int init[5][6];
int color[5][6];
int vec[5];
int cnt[24];
int ans;

void dfs(int dep)
{
	if(dep == n)
	{
		for(int i = 0; i < n; ++i)
			for(int j = 0; j < 6; ++j)
				color[i][j] = init[i][state[vec[i]][j]];
		int tans = 0;
		for(int j = 0; j < 6; ++j)
		{
			int maxface = 0;
			memset(cnt, 0, sizeof(cnt));
			for(int i = 0; i < n; ++i)
				maxface = max(maxface, ++cnt[color[i][j]]);
			tans += n-maxface;
		}
		ans = min(ans, tans);
		return;
	}
	for(int i = 0; i < 24; ++i)
	{
		vec[dep] = i;
		dfs(dep+1);
	}
}

int main()
{
	while(scanf("%d", &n), n)
	{
		rear = 0;
		for(int i = 0; i < n; ++i)
		{
			for(int j = 0; j < 6; ++j)
			{
				scanf("%s", str);
				init[i][j] = get_num(str);
			}
		}
		ans = n*6;
		vec[0] = 8;
		dfs(1);
		printf("%d\n", ans);
	}
	return 0;
}