uva1352

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;

const int maxn = 4;
int dir[24][6] = {
	{2, 1, 5, 0, 4, 3}, {2, 0, 1, 4, 5, 3}, {2, 4, 0, 5, 1, 3}, {2, 5, 4, 1, 0, 3},
	{4, 2, 5, 0, 3, 1}, {5, 2, 1, 4, 3, 0}, {1, 2, 0, 5, 3, 4}, {0, 2, 4, 1, 3, 5},
	{0, 1, 2, 3, 4, 5}, {4, 0, 2, 3, 5, 1}, {5, 4, 2, 3, 1, 0}, {1, 5, 2, 3, 0, 4},
	{5, 1, 3, 2, 4, 0}, {1, 0, 3, 2, 5, 4}, {0, 4, 3, 2, 1, 5}, {4, 5, 3, 2, 0, 1},
	{1, 3, 5, 0, 2, 4}, {0, 3, 1, 4, 2, 5}, {4, 3, 0, 5, 2, 1}, {5, 3, 4, 1, 2, 0},
	{3, 4, 5, 0, 1, 2}, {3, 5, 1, 4, 0, 2}, {3, 1, 0, 5, 4, 2}, {3, 0, 4, 1, 5, 2},
};
int n,input[maxn][6],color[maxn][6],r[maxn],ans,c;
unordered_map<string, int> mmp;

int GetId(string& str) {
	if (mmp.count(str)) return mmp[str];
	mmp[str] = ++c;
	return c;
}

void check() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 6; j++) {
			color[i][dir[r[i]][j]] = input[i][j];
		}
	}
	int tot = 0;
	for (int j = 0; j < 6; j++) {
		int cnt[maxn * 6];
		memset(cnt, 0, sizeof(cnt));
		int mc = 0;
		for (int i = 0; i < n; i++) {
			mc = max(mc, ++cnt[color[i][j]]);
		}
		tot += n - mc;
	}
	ans = min(ans, tot);
}

void dfs(int d) {
	if (d == n)check();
	else {
		for (int i = 0; i < 24; i++) {
			r[d] = i;
			dfs(d + 1);
		}
	}
}
int main() {
	string name;
	while (cin >> n && n) {
		mmp.clear(); c = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < 6; j++) {
				cin >> name;
				input[i][j] = GetId(name);
			}
		}
		ans = n * 6;
		r[0] = 0;
		dfs(1);
		cout << ans << endl;
	}
	return 0;
}