#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
struct MCMF {
  int n;
  struct Edge {
    int v;
    i64 w, c;
  };
  vector<Edge> e;
  vector<vector<int>> adj;
  vector<i64> dis, vis, pre, in;
  MCMF(int n = 0) : n(n), adj(n), vis(n), pre(n) {}
  void addEdge(int u, int v, i64 w, i64 c) {
    adj[u].push_back(e.size());
    e.push_back({v, w, c});
  }
  void add(int u, int v, i64 w, i64 c, int op = 0) {
    if (op) {
      swap(u, v);
    }
    addEdge(u, v, w, c);
    addEdge(v, u, 0, -c);
  }
  bool spfa(int s, int t) {
    dis.assign(n, 1e18);
    dis[s] = 0;
    in.assign(n, 0);
    in[s] = 1e18;
    queue<int> q;
    vis[s] = 1;
    q.push(s);
    while (!q.empty()) {
      int u = q.front();
      q.pop();
      vis[u] = 0;
      for (auto i : adj[u]) {
        auto [v, w, c] = e[i];
        if (dis[v] > dis[u] + c && w) {
          dis[v] = dis[u] + c;
          pre[v] = i;
          in[v] = min(in[u], w);
          if (!vis[v]) {
            vis[v] = 1;
            q.push(v);
          }
        }
      }
    }
    return in[t];
  }
  pair<i64, i64> work(int s, int t) {
    i64 flow = 0, cost = 0;
    while (spfa(s, t)) {
      flow += in[t];
      int u = t;
      while (u != s) {
        cost += in[t] * e[pre[u]].c;
        e[pre[u]].w -= in[t];
        e[pre[u] ^ 1].w += in[t];
        u = e[pre[u] ^ 1].v;
      }
    }
    return {flow, cost};
  }
};

int main() {
  cin.tie(0)->sync_with_stdio(0);
  vector<int> w(16);
  for (int s = 0; s < 16; s++) {
    w[s] = __builtin_popcount(s);
  }
  int n, m;
  cin >> n >> m;
  auto id = [&](int i, int j, int p) {
    return i * m + j + p * n * m;
  };
  int s = 4 * n * m, t = 4 * n * m + 1;
  MCMF mcmf(t + 1);
  i64 need = 0;
  vector<vector<int>> a(n, vector<int>(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
      int ct = 0, st = a[i][j], p = (i + j) & 1;
      need += (!p) * (ct = w[a[i][j]]);
      for (int k = 0; k < 4; k++) if (st >> k & 1) {
        if ((i + j) & 1) {
          mcmf.add(id(i, j, k), t, 1, 0);
        } else {
          mcmf.add(s, id(i, j, k), 1, 0);
        }
      }
      if (i) {
        mcmf.add(id(i, j, 0), id(i - 1, j, 2), 1, 0, p);
      }
      if (j) {
        mcmf.add(id(i, j, 3), id(i, j - 1, 1), 1, 0, p);
      }
      if (ct == 1) {
        for (int k = 0; k < 4; k++) if (st >> k & 1) {
          mcmf.add(id(i, j, k), id(i, j, (k + 1) % 4), 1, 1, p);
          mcmf.add(id(i, j, k), id(i, j, (k + 3) % 4), 1, 1, p);
          mcmf.add(id(i, j, k), id(i, j, (k + 2) % 4), 1, 2, p);
        }
      }
      if (ct == 2) {
        for (int k = 0, l = 1; k < 4; k++, (++l) %= 4) {
          if (st >> k & 1 && st >> l & 1) {
            mcmf.add(id(i, j, k), id(i, j, (k + 2) % 4), 1, 1, p);
            mcmf.add(id(i, j, l), id(i, j, (l + 2) % 4), 1, 1, p);
          }
        }
      }
      if (ct == 3) {
        for (int k = 0; k < 4; k++) if (!(st >> k & 1)) {
          mcmf.add(id(i, j, k), id(i, j, (k + 1) % 4), 1, 1, !p);
          mcmf.add(id(i, j, k), id(i, j, (k + 3) % 4), 1, 1, !p);
          mcmf.add(id(i, j, k), id(i, j, (k + 2) % 4), 1, 2, !p);
        }
      }
    }
  }
  auto [flow, cost] = mcmf.work(s, t);
  if (flow != need) {
    cout << -1 << "\n";
  } else {
    cout << cost << "\n";
  }
  return 0;
}