44pts

#include<bits/stdc++.h>
#define ag a[g.ix + dis[i][0]][g.iy + dis[i][1]]
//#define ll long long
//#define sizee (/*num*/)

using namespace std;

int n,m,a[11][11],bx,by;

bool vis[11][11];

int dis[4][2] = {{-1,0},{1,0},{0,-1},{0,1}};

struct ig{
	int ix;
	int iy;
	int hp;
	int step;
};

queue<ig> q;

void bfs(){
	while(!q.empty()){
		ig g = q.front();
		q.pop();
		if(a[g.ix][g.iy] == 4) g.hp = 6;
		if(a[g.ix][g.iy] == 3){
			cout << g.step << endl;
			return ;
		}
		if(g.hp == 1) break;
		for(int i = 0;i <= 3;++i){
			if(ag != 0){
				q.push(ig{g.ix + dis[i][0],g.iy + dis[i][1],g.hp - 1,g.step + 1});
				vis[g.ix + dis[i][0]][g.iy + dis[i][1]] = true;
			}
		}
	}
	cout << -1 << endl;
	return ;
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	//freopen("example.in","r",stdin);
	//freopen("example.out","w",stdout);
	cin >> n >> m;
	for(int i = 1;i <= n;++i){
		for(int j = 1;j <= n;++j){
			cin >> a[i][j];
			if(a[i][j] == 2){
				bx = i,by = j;
			}
		}
	}
	q.push(ig{bx,by,6,0});
	vis[bx][by] = true;
	bfs();
	return 0;
}
/*
  
 */