#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
#include <time.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;

struct Data{
	void set(int arg_row,int arg_col){
		row = arg_row;
		col = arg_col;
	}
	int row,col;
};

struct Info{
	int table[4][8],count;
	Data sace_loc[4];
	Data num_loc[48];
};

map<string,bool> MAP;
int ans_table[4][8];

string makeString(int table[4][8]){

	string ret;
	for(int row = 0; row < 4; row++){
		for(int col = 0; col < 8; col++){
			ret.append(to_string(table[row][col]));
		}
	}
	return ret;
}

bool checkClear(int table[4][8]){

	for(int row = 0; row < 4; row++){
		for(int col = 0; col < 8; col++){
			if(table[row][col] != ans_table[row][col])return false;
		}
	}

	return true;
}

void copyInfo(Info& to,Info from){

	for(int row = 0; row < 4; row++){
		for(int col = 0; col < 8; col++){
			to.table[row][col] = from.table[row][col];
		}
	}

	for(int i = 0; i < 4; i++){
		to.sace_loc[i] = from.sace_loc[i];
	}

	for(int i = 0; i < 48; i++)to.num_loc[i] = from.num_loc[i];
}


void func(){
	MAP.clear();

	Info first;
	first.table[0][0] = 0;
	first.table[1][0] = 0;
	first.table[2][0] = 0;
	first.table[3][0] = 0;

	for(int row = 0; row < 4; row++){
		for(int col = 1; col <= 7; col++){
			scanf("%d",&first.table[row][col]);
			switch(first.table[row][col]){
			case 11:
				first.table[0][0] = 11;
				first.table[row][col] = 0;
				first.sace_loc[0].set(row,col);
				break;
			case 21:
				first.table[1][0] = 21;
				first.table[row][col] = 0;
				first.sace_loc[1].set(row,col);
				break;
			case 31:
				first.table[2][0] = 31;
				first.table[row][col] = 0;
				first.sace_loc[2].set(row,col);
				break;
			case 41:
				first.table[3][0] = 41;
				first.table[row][col] = 0;
				first.sace_loc[3].set(row,col);
				break;
			default:
				first.num_loc[first.table[row][col]].set(row,col);
				break;
			}
		}
	}

	first.count = 0;
	string tmp = makeString(first.table);
	MAP[tmp] = true;

	queue<Info> Q;
	Q.push(first);

	int left_num;

	Data tmp_data;

	while(!Q.empty()){

		if(checkClear(Q.front().table)){
			printf("%d\n",Q.front().count);
			return;
		}else{

			for(int i = 0; i < 4; i++){

				left_num = Q.front().table[Q.front().sace_loc[i].row][Q.front().sace_loc[i].col-1];

				if(left_num == 0 || left_num%10 == 7)continue;

				tmp_data = Q.front().num_loc[left_num+1];

				Info next_info;
				copyInfo(next_info,Q.front());
				next_info.table[Q.front().sace_loc[i].row][Q.front().sace_loc[i].col] = left_num+1;
				next_info.table[tmp_data.row][tmp_data.col] = 0;
				next_info.num_loc[left_num+1].set(Q.front().sace_loc[i].row,Q.front().sace_loc[i].col);

				tmp = makeString(next_info.table);

				auto at = MAP.find(tmp);
				if(at != MAP.end())continue;

				MAP[tmp] = true;
				next_info.sace_loc[i].set(tmp_data.row,tmp_data.col);
				next_info.count = Q.front().count+1;
				Q.push(next_info);
			}
			Q.pop();
		}
	}

	printf("-1\n");
}

int main(){

	for(int col = 0; col <= 6; col++)ans_table[0][col] = 11+col;
	ans_table[0][7] = 0;
	for(int col = 0; col <= 6; col++)ans_table[1][col] = 21+col;
	ans_table[1][7] = 0;
	for(int col = 0; col <= 6; col++)ans_table[2][col] = 31+col;
	ans_table[2][7] = 0;
	for(int col = 0; col <= 6; col++)ans_table[3][col] = 41+col;
	ans_table[3][7] = 0;

	int case_num;
	scanf("%d",&case_num);

	for(int i = 0; i < case_num; i++)func();

}