#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int N;
unordered_map<ll, int> visited;
ll start_graph = 0;

typedef enum _Dir {
	horizon = 0,
	vertical,
} Dir;

class Vehicle {
public:
	Dir dir;
	vector<pii> locs;

	void update_dir() {
		if (locs.front().first - locs.back().first == 0)
			this->dir = horizon;
		else
			this->dir = vertical;
	}

	pii get_forward_loc() {
		int cr = locs.front().first;
		int cc = locs.front().second;
		int nr, nc;
		if (dir == vertical) {
			nr = cr - 1;
			nc = cc;
		}
		else {
			nr = cr;
			nc = cc - 1;
		}
		return { nr, nc };
	}

	pii get_backward_loc() {
		int cr = locs.back().first;
		int cc = locs.back().second;
		int nr, nc;
		if (dir == vertical) {
			nr = cr + 1;
			nc = cc;
		}
		else {
			nr = cr;
			nc = cc + 1;
		}
		return { nr, nc };
	}

	bool forward_unmovable(int nr, int nc, ll graph, int step) {
		if (nr < 0 || 6 <= nr || nc < 0 || 6 <= nc || graph & (1LL << (nr * 6 + nc)))
			return true;
		graph |= (1LL << (nr * 6 + nc));
		graph ^= (1LL << (locs.back().first * 6 + locs.back().second));
		if (visited.find(graph) != visited.end() && visited[graph] <= step)
			return true;
		return false;
	}

	bool back_unmovable(int nr, int nc, ll graph, int step) {
		if (nr < 0 || 6 <= nr || nc < 0 || 6 <= nc || graph & (1LL << (nr * 6 + nc)))
			return true;
		graph |= (1LL << (nr * 6 + nc));
		graph ^= (1LL << (locs.front().first * 6 + locs.front().second));
		if (visited.find(graph) != visited.end() && visited[graph] <= step)
			return true;
		return false;
	}

	ll move_foward(ll graph) {
		graph ^= (1LL << (locs.back().first * 6 + locs.back().second));
		if (dir == vertical)
			for (pii& loc : locs)
				loc.first--;
		else
			for (pii& loc : locs)
				loc.second--;
		graph |= (1LL << (locs.front().first * 6 + locs.front().second));
		return graph;
	}

	ll move_backward(ll graph) {
		graph ^= (1LL << (locs.front().first * 6 + locs.front().second));
		if (dir == vertical)
			for (pii& loc : locs)
				loc.first++;
		else
			for (pii& loc : locs)
				loc.second++;
		graph |= (1LL << (locs.back().first * 6 + locs.back().second));
		return graph;
	}
};

Vehicle vehicles[11];

void input() {
	int val;
	for (int i = 0; i < 6; i++) {
		for (int j = 0; j < 6; j++) {
			cin >> val;
			if (val) {
				vehicles[val].locs.push_back({ i, j });
				start_graph |= (1LL << (i * 6 + j));
				N = max(N, val);
			}
		}
	}
	for (int i = 1; i <= N; i++)
		vehicles[i].update_dir();
	visited.insert({ start_graph, 0 });
}

void DFS(int step, int& min_step, ll graph) {
	
	if (vehicles[1].locs.back().second == 5) {
		min_step = min(min_step, step);
		return;
	}
	if (step == 8 || step >= min_step)
		return;

	for (int i = 1; i <= N; i++) {
		Vehicle& curr = vehicles[i];
		auto [nr, nc] = curr.get_forward_loc();
		if (curr.forward_unmovable(nr, nc, graph, step) == false) {
			ll new_graph = curr.move_foward(graph);
			visited[new_graph] = step;
			DFS(step + 1, min_step, new_graph);
			curr.move_backward(graph);
		}
		auto [nnr, nnc] = curr.get_backward_loc();
		if (curr.back_unmovable(nnr, nnc, graph, step) == false) {
			ll new_graph = curr.move_backward(graph);
			visited[new_graph] = step;
			DFS(step + 1, min_step, new_graph);
			curr.move_foward(graph);
		}
	}
}


int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	//freopen("input.txt", "r", stdin);
	input();
	int min_step = 9;
	DFS(0, min_step, start_graph);
	if (min_step < 9)
		cout << min_step + 2;
	else
		cout << -1;
	return 0;
}