#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXP = 2e3 + 5;
const int dx[] = {-1,0,1,0};// U, R, D, L
const int dy[] = {0,1,0,-1};
const int inf = 0x3f3f3f3f;

template<const int MAXN,const int MAXM>
struct MCMF
{
	struct Edge
	{
		int next,to,flow,w;
	}e[MAXM<<1];
	int head[MAXN],etot;
	inline void add_one(int u,int v,int flow,int w)
	{
		e[++etot]=(Edge){ head[u],v,flow,w};
		head[u]=etot;
	}
	inline void add_edge(int u,int v,int flow,int w)
	{
		add_one(u,v,flow,w); add_one(v,u,0,-w);
	}
	
	int n,s,t;
	int dis[MAXN], h[MAXN], fl[MAXN], pre[MAXN];
	bool vis[MAXN];
	inline void clear(void){ etot=-1; memset(head,-1,sizeof(head));}
	inline void init(int _n,int _s,int _t){ n=_n; s=_s; t=_t;}
	MCMF(void){ clear();}
	inline bool spfa(void)
	{
		memset(dis,0x3f,(n+1)<<2); memset(vis,0,n+1);
		queue<int> q;
		fl[s] = inf;
		dis[s] = 0; vis[s] = 1; q.push(s);
		while(q.size())
		{
			int u=q.front(); q.pop();
			vis[u] = 0;
			for(int i=head[u]; ~i; i=e[i].next) if(e[i].flow)
			{
				int v = e[i].to, nxt = dis[u] + e[i].w;
				if(nxt < dis[v])
				{
					dis[v] = nxt; pre[v] = i;
					fl[v] = min(fl[u], e[i].flow);
					if(!vis[v]) q.push(v), vis[v] = 1;
				}
			}
		}
		return dis[t] != inf;
	}
	inline bool dijkstra(void)
	{
		memset(dis,0x3f,(n+1)<<2); memset(vis,0,n+1);
		priority_queue<pii> q;
		fl[s] = inf;
		dis[s] = 0; q.emplace(0, s);
		while(q.size())
		{
			int u=q.top().second; q.pop();
			if(vis[u]) continue;
			vis[u]=1;
			for(int i=head[u]; ~i; i=e[i].next) if(e[i].flow)
			{
				int v = e[i].to, nxt = dis[u] + e[i].w + h[u] - h[v];
				if(nxt < dis[v])
				{
					dis[v] = nxt; pre[v] = i;
					fl[v] = min(fl[u], e[i].flow);
					q.emplace(-dis[v], v);
				}
			}
		}
		return vis[t];
	}
	pii build(void)
	{
		memset(h,0,(n+1)<<2);
		int resf = 0, resc = 0;
		if(spfa()) do
		{
			for(int i=0; i<=n; ++i)
				h[i] = min(inf, h[i] + dis[i]);
			resc += fl[t] * h[t]; resf += fl[t];
			for(int u=t; u!=s; u=e[pre[u]^1].to)
				e[pre[u]].flow -= fl[t],
				e[pre[u]^1].flow += fl[t];
		}while(dijkstra());
		return {resf, resc};
	}
};

MCMF<MAXP, MAXP * 6> mcmf;

int n,m;
inline bool isin(int x,int y){ return x>=0 && x<n && y>=0 && y<m;}
inline int encode(int x,int y){ return x * m + y;}
inline void decode(int u,int &x,int &y){ x=u/m; y=u%m;}
inline int walk(int u,int k)
{
	int x = u/m + dx[k], y = u%m + dy[k];
	return isin(x,y)? encode(x,y): -1;
}

#define bbit(i) (1<<(i))
#define bdig(x,i) (((x)>>(i))&1)

int a[MAXP], num1[MAXP], type[MAXP];

int main(void)
{
	scanf("%d%d",&n,&m);
	int pcnt = n * m;
	for(int i=0; i<pcnt; ++i) scanf("%d",&a[i]);
	
	int S = pcnt, T = pcnt+1;
	mcmf.init(T, S, T);
	
	int sum1 = 0, sum2 = 0;
	for(int i=0; i<pcnt; ++i)
	{
		int k = num1[i] = __builtin_popcount(a[i]);
		int x,y; decode(i,x,y);
		type[i] = (x^y)&1;
		
		if(type[i]) mcmf.add_edge(S, i, k, 0), sum1 += k;
		else mcmf.add_edge(i, T, k, 0), sum2 += k;
	}
	if(sum1 != sum2)
	{
		printf("-1");
		return 0;
	}
	
	auto getcost = [&] (int u,int k)
	{
		if(num1[u] == 1)
		{
			if(bdig(a[u], k) == 1)
				return 0;
			else if(bdig(a[u], k^2) == 1)
				return 2;
			else
				return 1;
		}
		else if(num1[u] == 2)
		{
			if(a[u] == 8+2 || a[u] == 4+1)
				return bdig(a[u], k)? 0: inf;
			else
				return bdig(a[u], k)? 0: 1;
		}
		else if(num1[u] == 3)
		{
			if(bdig(a[u], k) == 0)
				return 1;
			else if(bdig(a[u], k^2) == 0)
				return -1;
			else
				return 0;
		}
		else if(num1[u] == 4)
			return 0;
		else
			return inf;
	};
	
	for(int u=0; u<pcnt; ++u) if(type[u])
		for(int k=0; k<4; ++k)
		{
			int v = walk(u,k);
			if(v == -1) continue;
			int c = getcost(u, k) + getcost(v, k^2);
			if(c >= inf / 2) continue;
			mcmf.add_edge(u, v, 1, c);
		}
	
	int has = count(num1, num1+pcnt, 3);
	pii res = mcmf.build();
	
	if(res.first != sum1)
		printf("-1");
	else
		printf("%d",res.second + has);
	return 0;
}