#include <bits/stdc++.h>
using namespace std;
bool v[3000][3000];
int ps[3000],ps2[3000];
int lines[3000];
int main(){
    int n,m,i,j,cnt = 0;
    char ch;
    cin>>n>>m;
    if(m%2 == 1){
        for(i = 0;i < n;i++)for(j = 0;j < m;j++){
            cin>>ch;v[j][i] = ch - '1';
        }
        swap(n,m);
    }else for(i = 0;i < n;i++)for(j = 0;j < m;j++){
        cin>>ch;v[i][j] = ch - '1';
    }
    if(n == 1){
        for(i = 0;i < n;i++){
            for(j = 0;j < m;j++){
                cnt+=v[i][j];
            }
        }
        if(cnt == n*m){
            cout<<1;
        }else if(cnt == 0){
            cout<<0;
        }else cout<<-1;
    }else if(n%2 == 0){
        for(i = 0;i < n;i++){
            for(j = 0;j < m;j++){
                ps[i]+=v[i][j];
                ps2[j]+=v[i][j];
            }
        }
        for(i = 0;i < n;i++){
            for(j = 0;j < m;j++){
                cnt+=((ps[i] + ps2[j] + v[i][j])%2);
            }
        }
        cout<<cnt;
    }else{
        bool ok = 1;
        int cnt2 = 0;
        for(i = 0;i < n;i++){
            for(j = 0;j < m;j++){
                if(i == n - 1){
                    cnt2+=(v[i][j] == cnt);
                }else{
                    v[n - 1][j]^=v[i][j];
                    cnt+=v[i][j];cnt%=2;
                    ps[i]+=v[i][j];ps2[j]+=v[i][j];
                }
            }
        }
        if(cnt2 != 0 && cnt2 != m){
            cout<<-1;
        }else{
            if(cnt2 == m){
                for(i = 0;i < n - 1;i++){
                    for(j = 0;j < m;j++){
                        lines[j]+=(v[i][j]+ps[i]+ps2[j])%2;
                    }
                }
                sort(lines,lines + m);
                int sum = 0,ans = 2e9;
                for(i = m-1;i >= 0;i--)sum+=lines[i];//cout<<lines[i]<<' ';
                ans = min(ans,sum);
                for(i = m-1;i >= 0;i-=2){
                    sum-=lines[i];sum-=lines[i - 1];
                    lines[i] = n - lines[i];
                    lines[i - 1] = n - lines[i - 1];
                    sum+=lines[i];sum+=lines[i - 1];
                    ans = min(ans,sum);
                }
                cout<<ans;
            }else{
                for(i = 0;i < n - 1;i++){
                    for(j = 0;j < m;j++){
                        lines[j]+=(v[i][j]+ps[i]+ps2[j])%2;
                    }
                }
                for(j = 0;j < m;j++)lines[j]++;
                sort(lines,lines + m);
                int sum = 0,ans = 2e9;
                for(i = m-1;i >= 0;i--)sum+=lines[i];
                sum-=lines[m - 1];lines[m - 1] = n - lines[m - 1];sum+=lines[m - 1];
                ans = min(ans,sum);
                for(i = m-2;i >= 0;i-=2){
                    sum-=lines[i];sum-=lines[i - 1];
                    lines[i] = n - lines[i];
                    lines[i - 1] = n - lines[i - 1];
                    sum+=lines[i];sum+=lines[i - 1];
                    ans = min(ans,sum);
                }
                cout<<ans;
            }
        }
    }
    return 0;
}
/**
3 4
1 2 1 2
1 1 2 2
2 1 1 2
3 4
2 2 2 2
2 2 2 2
2 2 2 2
**/