#include<bits/stdc++.h>
using namespace std;
const int N=2e6+5,INF=1e9;
const int dx[]={0,-1,0,1,0};
const int dy[]={0,0,1,0,-1};
const int px[]={0,3,4,1,2};
//  a  b  c  d  数的二进制表示 
//  8  4  2  1  位权 
// 左 下 右 上  方向
//  4  3  2  1  编号 
int n,m,a[N],head[N],tot=1,S,T,sum;
struct edge{int v,w,c,nxt;}e[N];
inline void add(int u,int v,int w,int c)
{
	e[++tot].v=v,e[tot].w=w,e[tot].c=c;
	e[tot].nxt=head[u],head[u]=tot;
}
inline void addedge(int u,int v,int w,int c){add(u,v,w,c),add(v,u,-w,0);}
int cur[N],dis[N],mincost,maxflow;
bool vis[N]; queue<int> q;
inline bool spfa()
{
	for(int i=0;i<=T;i++)dis[i]=INF,vis[i]=false;
	dis[S]=0,vis[S]=true; q.push(S);
	while(!q.empty())
	{
		int u=q.front(); q.pop(); vis[u]=false;
		for(int i=head[u];i;i=e[i].nxt)
		{
			int v=e[i].v;
			if(dis[v]>dis[u]+e[i].w&&e[i].c)
			{
				dis[v]=dis[u]+e[i].w;
				if(!vis[v])q.push(v),vis[v]=true;
			}
		}
	}
	return dis[T]!=INF;
}
int dfs(int u,int minf)
{
	if(u==T||!minf) return minf;
	int flow=0,f; vis[u]=true;
	for(int i=cur[u];i;i=e[i].nxt)
	{
		int v=e[i].v; cur[u]=i;
		if(!vis[v]&&e[i].c&&dis[v]==dis[u]+e[i].w)
		{
			f=dfs(v,min(minf,e[i].c));
			if(f)minf-=f,flow+=f,e[i].c-=f,e[i^1].c+=f,mincost+=f*e[i].w;
			if(!minf) return vis[u]=false,flow;
		}	
	} 
	return vis[u]=false,flow;
}
inline void MCMF()
{
	while(spfa())
	{
		for(int i=1;i<=T;i++)cur[i]=head[i];
		while(int x=dfs(S,INF))maxflow+=x;
	}
}
inline int num(int i,int j,int op){return (i-1)*m+j+op*n*m;}
inline void work(int x,int y,int val)
{
	if((x+y)&1)
	{
		addedge(S,num(x,y,0),0,INF);
		for(int i=1;i<=4;i++)
		{
			int idx=x+dx[i],idy=y+dy[i];
			if(idx<1||idx>n||idy<1||idy>m)continue;
			addedge(num(x,y,i),num(idx,idy,px[i]),0,1);
		}
		for(int i=1;i<=4;i++)if((val&(1<<(i-1))))addedge(num(x,y,0),num(x,y,i),0,1),++sum;
		int up=num(x,y,1),rt=num(x,y,2),dn=num(x,y,3),lt=num(x,y,4);
		switch(val)
		{
			case  1:addedge(up,rt,1,1),addedge(up,dn,2,1),addedge(up,lt,1,1);break;
			case  2:addedge(rt,up,1,1),addedge(rt,dn,1,1),addedge(rt,lt,2,1);break;
			case  4:addedge(dn,up,2,1),addedge(dn,lt,1,1),addedge(dn,rt,1,1);break;
			case  8:addedge(lt,up,1,1),addedge(lt,rt,2,1),addedge(lt,dn,1,1);break;
			case  3:addedge(rt,lt,1,1),addedge(up,dn,1,1);break;
			case  6:addedge(dn,up,1,1),addedge(rt,lt,1,1);break;
			case  9:addedge(lt,rt,1,1),addedge(up,dn,1,1);break;
			case 12:addedge(lt,rt,1,1),addedge(dn,up,1,1);break;
			case  7:addedge(up,lt,1,1),addedge(rt,lt,2,1),addedge(dn,lt,1,1);break;
			case 11:addedge(up,dn,2,1),addedge(rt,dn,1,1),addedge(lt,dn,1,1);break;
			case 13:addedge(up,rt,1,1),addedge(dn,rt,1,1),addedge(lt,rt,2,1);break;
			case 14:addedge(rt,up,1,1),addedge(lt,up,1,1),addedge(dn,up,2,1);break;
		}
	}
	else
	{
		addedge(num(x,y,0),T,0,INF);
		for(int i=1;i<=4;i++)if((val&(1<<(i-1))))addedge(num(x,y,i),num(x,y,0),0,1),++sum;
		int up=num(x,y,1),rt=num(x,y,2),dn=num(x,y,3),lt=num(x,y,4); 
		switch(val)
		{
			case  1:addedge(rt,up,1,1),addedge(dn,up,2,1),addedge(lt,up,1,1);break;
			case  2:addedge(up,rt,1,1),addedge(lt,rt,2,1),addedge(dn,rt,1,1);break;
			case  4:addedge(up,dn,2,1),addedge(lt,dn,1,1),addedge(rt,dn,1,1);break;
			case  8:addedge(up,lt,1,1),addedge(dn,lt,1,1),addedge(rt,lt,2,1);break;
			case  3:addedge(lt,rt,1,1),addedge(dn,up,1,1);break;
			case  6:addedge(up,dn,1,1),addedge(lt,rt,1,1);break;
			case  9:addedge(rt,lt,1,1),addedge(dn,up,1,1);break;
			case 12:addedge(rt,lt,1,1),addedge(up,dn,1,1);break;
			case  7:addedge(lt,rt,2,1),addedge(lt,up,1,1),addedge(lt,dn,1,1);break;
			case 11:addedge(dn,up,2,1),addedge(dn,lt,1,1),addedge(dn,rt,1,1);break;
			case 13:addedge(rt,up,1,1),addedge(rt,dn,1,1),addedge(rt,lt,2,1);break;
			case 14:addedge(up,rt,1,1),addedge(up,lt,1,1),addedge(up,dn,2,1);break;
		}
	}
}
int main()
{
	cin.tie(0)->sync_with_stdio(false);cout.tie(0); 
	cin>>n>>m; S=n*m*5+1; T=S+1;
	for(int i=1,val;i<=n;i++)for(int j=1;j<=m;j++)cin>>val,work(i,j,val);
	MCMF();
	if(maxflow*2!=sum) cout<<-1;
	else cout<<mincost;
	return 0;
}