#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define each(i, a) for(auto &i : a)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }

int ans = 0;
VI p(31);
void ope(VI& a, int type) {
    if (type == 0) {
        swap(a[1], a[28]);
        swap(a[2], a[29]);
        swap(a[3], a[30]);
        swap(a[15], a[16]);
        swap(a[19], a[21]);
    }
    else if (type == 1) {
        swap(a[1], a[24]);
        swap(a[4], a[27]);
        swap(a[7], a[30]);
        swap(a[10], a[21]);
        swap(a[16], a[18]);
    }
    else if (type == 2) {
        swap(a[3], a[22]);
        swap(a[6], a[25]);
        swap(a[9], a[28]);
        swap(a[12], a[19]);
        swap(a[13], a[15]);
    }
    else if (type == 3) {
        swap(a[7], a[22]);
        swap(a[8], a[23]);
        swap(a[9], a[24]);
        swap(a[13], a[18]);
        swap(a[10], a[12]);
    }
};

bool check(const VI& a) {
    eFOR(i, 1, 9)eFOR(j, i + 1, 9)if (a[i] != a[j])return false;
    eFOR(i, 10, 12)eFOR(j, i + 1, 12)if (a[i] != a[j])return false;
    eFOR(i, 13, 15)eFOR(j, i + 1, 15)if (a[i] != a[j])return false;
    eFOR(i, 16, 18)eFOR(j, i + 1, 18)if (a[i] != a[j])return false;
    eFOR(i, 19, 21)eFOR(j, i + 1, 21)if (a[i] != a[j])return false;
    eFOR(i, 22, 30)eFOR(j, i + 1, 30)if (a[i] != a[j])return false;
    return true;
};

void solve(VI& a, int cur) {
    if (check(a)) {
        chmin(ans, cur);
        return;
    }
    if (ans <= cur + 1)return;
    FOR(i, 0, 4) {
        ope(a, i);
        solve(a, cur + 1);
        ope(a, i);
    }
};

void testcase() {
    ans = 8;
    eFOR(i, 1, 30)cin >> p[i];
    solve(p, 0);
    print(ans);
}

void multicases() {
    int t; cin >> t;
    while (t--)testcase();
}

int main() {
    init();

    multicases();

    return 0;
}


Measured memory_bytes: 3216