// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}



const int N = 6005, M = N + N * 4, INF = 0x3f3f3f3f, Z = 2005;

int n, m, s, t, maxflow, cost, d[N], incf[N], pre[N];

int q[N];

int head[N], numE = 1;

bool vis[N];

struct E{
    int next, v, w, c;
} e[M << 1];

void inline add(int u, int v, int w, int c) {
    e[++numE] = (E) { head[u], v, w, c };
    head[u] = numE;
}

void inline addE(int u, int v, int w, int c) {
	add(u, v, w, c), add(v, u, 0, -c);
}

// Spfa || 
bool spfa() {
    memset(vis, false, sizeof vis);
    memset(d, 0x3f, sizeof d);
    int hh = 0, tt = 1;
    q[0] = s; d[s] = 0; incf[s] = 2e9;
    while (hh != tt) {
        int u = q[hh++]; vis[u] = false;
        if (hh == N) hh = 0;
        for (int i = head[u]; i; i = e[i].next) {
            int v = e[i].v;
            if (e[i].w && d[u] + e[i].c < d[v]) {
                d[v] = d[u] + e[i].c;
                pre[v] = i;
                incf[v] = min(incf[u], e[i].w);
                if (!vis[v]) {
                    q[tt++] = v;
                    vis[v] = true;
                    if (tt == N) tt = 0;
                }
            }
        }
    } 
    return d[t] != INF;
}

void update() {
    int x = t;
    while (x != s) {
        int i = pre[x];
        e[i].w -= incf[t], e[i ^ 1].w += incf[t];
        x = e[i ^ 1].v;
    }
    maxflow += incf[t];
    cost += d[t] * incf[t];
}

int w[Z][Z][4], p[Z][Z][4], sum, num[Z][Z];

int inline id(int x, int y) {
	return (x - 1) * m + y;
}

int main() {
	memset(w, 0x3f, sizeof w);
    read(n), read(m);
    s = n * m + 1, t = s + 1;
    int idx = t;
    for (int i = 1; i <= n; i++) {
    	for (int j = 1; j <= m; j++) {
    		int x; read(x);
    		int o = 0;
    		for (int k = 0; k < 4; k++) o += (x >> k & 1), p[i][j][k] = id(i, j);
    		num[i][j] = o;
    		if (o == 4) {
    			for (int k = 0; k < 4; k++)
    				w[i][j][k] = 0;
    		} else if (o == 3) {
    			int v = 0;
    			while (x >> v & 1) v++;
    			w[i][j][v] = 2;
    			w[i][j][(v + 1) % 4] = 1;
    			w[i][j][(v + 3) % 4] = 1;
    			w[i][j][(v + 2) % 4] = 0;
    			sum -= 2;
    		} else if (o == 2) {
    			int v = 0;
    			while (!(x >> v & 1)) v++;
    			int u = v + 1;
    			while (!(x >> u & 1)) u++;
    			if (v + 2 == u) {
    				w[i][j][u] = w[i][j][v] = 0;
    			} else {
    				p[i][j][3] = p[i][j][1] = ++idx;
    				if ((i + j) % 2 == 0) addE(id(i, j), idx, 1, 0);
    				else addE(idx, id(i, j), 1, 0); 
    				p[i][j][2] = p[i][j][0] = ++idx;
    				if ((i + j) % 2 == 0) addE(id(i, j), idx, 1, 0);
    				else addE(idx, id(i, j), 1, 0); 
    				for (int k = 0; k < 4; k++)
    					w[i][j][k] = !(x >> k & 1);
    			}
    		} else if (o == 1) {
    			int v = 0;
    			while (!(x >> v & 1)) v++;
    			w[i][j][v] = 0;
    			w[i][j][(v + 1) % 4] = 1;
    			w[i][j][(v + 3) % 4] = 1;
    			w[i][j][(v + 2) % 4] = 2;
    		}
    	}
    }
    
    int z = 0;
    for (int i = 1; i <= n; i++) {
    	for (int j = 1; j <= m; j++) {
    		int c = (i + j) & 1, now = id(i, j);
    		z += num[i][j];
    		if (!c) {
    			addE(s, now, num[i][j], 0);
    			if (i > 1) {
    				int c = w[i][j][0] + w[i - 1][j][2];
    				if (c < INF) addE(p[i][j][0], p[i - 1][j][2], 1, c); //, cout << i << " " << j << " up " << c << endl;
    			}
    			if (i < n) {
    				int c = w[i][j][2] + w[i + 1][j][0];
    				if (c < INF) addE(p[i][j][2], p[i + 1][j][0], 1, c); //, cout << i << " " << j << " dw " << c << endl;
    			}
    			if (j > 1) {
    				int c = w[i][j][3] + w[i][j - 1][1];
    				if (c < INF) addE(p[i][j][3], p[i][j - 1][1], 1, c); //, cout << i << " " << j << " le " << c << endl;
    			}
    			if (j < m) {
    				int c = w[i][j][1] + w[i][j + 1][3];
    				if (c < INF) addE(p[i][j][1], p[i][j + 1][3], 1, c); //, cout << i << " " << j << " re " << c << endl;
    			}
    		} else {
    			addE(now, t, num[i][j], 0);
    		}
    	}
    }
    while (spfa()) update();
     //cout << z << "??" << maxflow << endl;
    if (z != maxflow * 2) puts("-1");
    else {
    	printf("%d\n", sum + cost);
    }
    return 0;
}