// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
namespace Dinic
{
    uint To[60005],Last[60005],End[10005],Cur[10005],n,tp;
    bol Flow[60005],Init[60005];int Cost[60005],Dist[10005];
    voi build(uint n){Dinic::n=n,tp=0;for(uint i=0;i<n;i++)End[i]=-1;}
    voi insert(uint u,uint v,llt c)
    {
        To[tp]=v,Last[tp]=End[u],Flow[tp]=true,Cost[tp]=c,End[u]=tp++;
        To[tp]=u,Last[tp]=End[v],Flow[tp]=false,Cost[tp]=-c,End[v]=tp++;
    }
    bol bfs(uint p,uint t)
    {
        for(uint i=0;i<n;i++)Dist[i]=1e9,Cur[i]=End[i];
        Dist[p]=0;std::queue<uint>Q;Q.push(p),Init[p]=true;
        while(Q.size())
        {
            p=Q.front(),Q.pop(),Init[p]=false;
            for(uint e=End[p];~e;e=Last[e])
                if(Flow[e]&&_min(Dist[To[e]],Dist[p]+Cost[e])&&!Init[To[e]])
                    Q.push(To[e]),Init[To[e]]=true;
        }
        return Dist[t]<1e8;
    }
    bol dfs(uint p,uint t)
    {
        if(p==t)return true;
        if(Init[p])return false;
        Init[p]=true;
        for(uint&e=Cur[p];~e;e=Last[e])if(Flow[e]&&Dist[To[e]]==Dist[p]+Cost[e]&&dfs(To[e],t))
            return Flow[e]=Init[p]=false,Flow[e^1]=true;
        return Init[p]=false;
    }
    std::pair<uint,int>run(uint p,uint t)
    {
        uint ans=0;int c=0;
        while(bfs(p,t))
        {
            Init[p]=true;
            for(uint e=End[p];~e;e=Last[e])if(Flow[e]&&Dist[To[e]]==Cost[e]&&dfs(To[e],t))
                ans++,c+=Dist[t],Flow[e]=false;
        }
        return{ans,c};
    }
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint n,m;scanf("%u%u",&n,&m),Dinic::build(4*n*m+2);
    for(uint i=1;i<n;i++)for(uint j=0;j<m;j++)
        if((i+j)&1)Dinic::insert(((i-1)*m+j)<<2|2,(i*m+j)<<2,0);
        else Dinic::insert((i*m+j)<<2,((i-1)*m+j)<<2|2,0);
    for(uint i=0;i<n;i++)for(uint j=1;j<m;j++)
        if((i+j)&1)Dinic::insert((i*m+(j-1))<<2|1,(i*m+j)<<2|3,0);
        else Dinic::insert((i*m+j)<<2|3,(i*m+(j-1))<<2|1,0);
    uint cnt=0;
    for(uint p=0,v;p<n*m;p++)
    {
        uint op=(p/m+p%m)&1;
        scanf("%u",&v);
        if(!(v%5))
        {
            for(uint o=0;o<4;o++)if(v>>o&1)
            {
                cnt++;
                if(op)Dinic::insert(p<<2|o,(n*m)<<2|1,0);else Dinic::insert((n*m)<<2,p<<2|o,0);
            }
            continue;
        }
        if(v==lowbit(v))
        {
            uint o=v<=2?v==2:2+(v==8);cnt++;
            if(op)Dinic::insert(p<<2|o,(n*m)<<2|1,0),
                Dinic::insert(p<<2|(o^1),p<<2|o,1),
                Dinic::insert(p<<2|(o^2),p<<2|o,2),
                Dinic::insert(p<<2|(o^3),p<<2|o,1);
            else Dinic::insert((n*m)<<2,p<<2|o,0),
                Dinic::insert(p<<2|o,p<<2|(o^1),1),
                Dinic::insert(p<<2|o,p<<2|(o^2),2),
                Dinic::insert(p<<2|o,p<<2|(o^3),1);
            continue;
        }
        if((15^v)==lowbit(15^v))
        {
            uint o=v>=13?v==13:2+(v==7);cnt+=3;
            if(op)Dinic::insert(p<<2|o,p<<2|(o^1),1),
                Dinic::insert(p<<2|o,p<<2|(o^2),2),
                Dinic::insert(p<<2|o,p<<2|(o^3),1),
                Dinic::insert(p<<2|(o^1),(n*m)<<2|1,0),
                Dinic::insert(p<<2|(o^2),(n*m)<<2|1,0),
                Dinic::insert(p<<2|(o^3),(n*m)<<2|1,0);
            else Dinic::insert(p<<2|(o^1),p<<2|o,1),
                Dinic::insert(p<<2|(o^2),p<<2|o,2),
                Dinic::insert(p<<2|(o^3),p<<2|o,1),
                Dinic::insert((n*m)<<2,p<<2|(o^1),0),
                Dinic::insert((n*m)<<2,p<<2|(o^2),0),
                Dinic::insert((n*m)<<2,p<<2|(o^3),0);
            continue;
        }
        for(uint o=0;o<4;o++)if(v>>o&1)
        {
            cnt++;
            if(op)
                Dinic::insert(p<<2|o,(n*m)<<2|1,0),
                Dinic::insert(p<<2|(o^2),p<<2|o,1);
            else
                Dinic::insert((n*m)<<2,p<<2|o,0),
                Dinic::insert(p<<2|o,p<<2|(o^2),1);
        }
    }
    auto t=Dinic::run((n*m)<<2,(n*m)<<2|1);
    if(t.first*2!=cnt)return puts("-1"),0;
    printf("%d\n",t.second);
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。