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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;
using vb=vector<bool>;using vs=vector<string>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<typename T>T read(){T t;cin>>t;return t;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){o<<'('<<p.fst<<", "<<p.snd<<')';return o;}

template<typename T> bool inside(T y, T x, T h, T w) { return 0 <= y && y < h && 0 <= x && x < w; };
int DY[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int DX[8] = {0, 1, 0, -1, 1, -1, 1, -1};

void flip(int &x) {
  if (x) x = 0;
  else x = 1;
}

int enc(vi &m) {
  int ret = 0;
  forr(x, m) {
    ret *= 2;
    ret += x;
  }
  return ret;
}

template<class T> bool amin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }

const int inf = 1e9;

int solve() {
  int h = read<int>();
  int w = read<int>();

  vvi M(h, vi(w));
  rep(y, h) rep(x, w) M[y][x] = read<int>();

  vvvi dp(h+1, vvi(bit(w), vi(bit(w), inf)));

  rep(i, bit(w)) {
    vi st(3);
    st[1] = enc(M[0]);
    st[2] = enc(M[1]);
    int y = 0;
    rep(x, w) if (i & bit(x)) {
      st[1] ^= bit(x);
      rep(lo, 8) {
        int dy = DY[lo];
        int dx = DX[lo];
        if (!inside(y+dy, x+dx, h, w)) continue;
        st[1+dy] ^= bit(x+dx);
      }
    }
    amin(dp[0][st[1]][st[2]], __builtin_popcount(i));
  }

  rep(dpy, h) {
    rep(bity0, bit(w)) {
      rep(bity1, bit(w)) {
        int cur = dp[dpy][bity0][bity1];
        int y = dpy+1;
        int bity2 = (y+1 >= h ? 0 : enc(M[y+1]));

        rep(i, bit(w)) {
          vi st(3);
          st[0] = bity0;
          st[1] = bity1;
          st[2] = bity2;
          rep(x, w) if (i & bit(x)) {
            st[1] ^= bit(x);
            rep(lo, 8) {
              int dy = DY[lo];
              int dx = DX[lo];
              if (!inside(y+dy, x+dx, h, w)) continue;
              st[1+dy] ^= bit(x+dx);
            }
          }
          if (st[0] != 0) continue;
          amin(dp[dpy+1][st[1]][st[2]], cur + __builtin_popcount(i));
        }
      }
    }
  }

  if (dp[h][0][0] == inf) return -1;
  return dp[h][0][0];
}

void Main() {
  cout << solve() << endl;
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }