#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define ov4(a, b, c, d, name, ...) name
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
const ll INF = LLONG_MAX / 4;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vc<vector<T>>;
void solve() {
    vc<ll> board(36);
    ll ma = 0;
    rep(i, 6) rep(j, 6) cin >> board[i * 6 + j], ma = max(ma, board[i * 6 + j]);
    map<vc<ll>, ll> memo;
    queue<vc<ll>> que;
    que.push(board);
    memo[board] = 0;
    ll res = 11;
    vc<pair<ll, ll>> sz(ma);
    rep(i, ma) {
        ll h1 = -1, w1 = -1, h2 = -1, w2 = -1;
        rep(j, 6) {
            rep(k, 6) {
                if (board[j * 6 + k] == i + 1) {
                    h1 = j, w1 = k;
                    break;
                }
            }
            if (h1 != -1) break;
        }
        for (ll j = 5; j >= 0; j--) {
            for (ll k = 5; k >= 0; k--) {
                if (board[j * 6 + k] == i + 1) {
                    h2 = j, w2 = k;
                    break;
                }
            }
            if (h2 != -1) break;
        }
        sz[i] = {h2 - h1 + 1, w2 - w1 + 1};
    }
    if (sz[0].first == 2) {
        cout << -1 << endl;
        return;
    }
    ll dy[] = {1, 0, -1, 0}, dx[] = {0, 1, 0, -1};
    auto move = [&](vc<ll>& b, ll i, ll j, ll id, ll dis) -> void {
        rep(k, 4) {
            bool ok = true;
            rep(l, sz[id].first) rep(m, sz[id].second) {
                ll ny = i + l + dy[k], nx = j + m + dx[k];
                if (!(0 <= ny and ny < 6 and 0 <= nx and nx < 6)) ok = false;
                if (!(b[ny * 6 + nx] == id + 1 or b[ny * 6 + nx] == 0)) ok = false;
            }
            if (k % 2 == 0 and sz[id].first == 1) ok = false;
            if (k % 2 == 1 and sz[id].second == 1) ok = false;
            if (!ok) continue;
            auto c = b;
            rep(l, sz[id].first) rep(m, sz[id].second) c[(i + l) * 6 + j + m] = 0;
            rep(l, sz[id].first) rep(m, sz[id].second) {
                ll ny = i + l + dy[k], nx = j + m + dx[k];
                c[ny * 6 + nx] = id + 1;
            }
            if (memo.count(c)) continue;
            memo[c] = dis + 1;
            que.push(c);
        }
        if (id == 0) {
            if (i == 2) {
                if (j == 4) res = min(res, dis + 2);
            }
        }
    };
    while (!que.empty()) {
        auto from = que.front();
        que.pop();
        vc<ll> used(ma);
        ll dis = memo[from];
        rep(i, 6) rep(j, 6) {
            if (from[i * 6 + j]) {
                ll id = from[i * 6 + j] - 1;
                if (used[id]) continue;
                used[id] = true;
                move(from, i, j, id, dis);
            }
        }
    }
    cout << (res > 10 ? -1 : res) << endl;
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(20);
    ll t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) solve();
}