#pragma GCC optimize ("O3")

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int ll
typedef tree<
        pair<int, int>,
        null_type,
        less<pair<int, int>>,
        rb_tree_tag,
        tree_order_statistics_node_update>
        ordered_set;//order_of_key()->gives how many elements less than specific element in the set ,, find_by_order() ->find specific element by index the set
#define  ll long long
#define  el '\n'
#define IO       \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);

#define endl '\n'
using namespace std;
int const N  =  2e6 +5  ;

void  megz(int n){
    deque<int>dq (1,1) ;
    while (n--){
        int rem = 0 ;
        int num = 0 ;
        for (int i = dq.size()-1  ; i>=0 ;i--){
            num  =  dq[i]*2+rem;
            dq[i] =  num%10 ;
            rem =  num/10 ;
        }
        // cout <<dq.size()<<endl ;
        if (rem)dq.push_front(1);

    }
    for (auto x  :  dq){
        cout <<x ;
    }
    // cout <<endl;

}

signed main() {
    //   IO

    int n,m;
    cin>>n>>m;
    if (n>1 and m>1) {
        int zeroes = 0, towes = 0, ones = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                int x;
                cin >> x;
                if (x == 0)
                    zeroes++;
                else if (x == 2)
                    towes++;
                else
                    ones++;
            }
        }
        bool can = 0;
        if (zeroes >= 2) {
            can = 1;
            cout << 0;
        } else if (zeroes == 1 && towes >= 1 && ones >= 1) {
            can = 1;
            cout << 1;
        } else if (zeroes == 1 && towes == 0) {
            can = 1;
            cout << 1;
        } else if (zeroes == 1 && towes >= 1) {
            can = 1;
            cout << 2;
        } else if (ones >= 1 && towes == 0 && zeroes == 0) {
            can = 1;
            cout << 0;
        } else if (zeroes == 0) {
            can = 1;
            if (towes % 2 == 0)
                cout << 0;
            else {
                // long double x= pow(2,towes/2);//   cout<<(ll)x;
                megz(towes / 2);
            }
        }
    }
    else {
        map <int , int >mp ;
        vector<int> v(n*m) ;
        for (int i =0 ; i < n*m ; i++){
            int x ;cin >>x;
            mp[x]++;
            v[i]=x;
        }
        //cout<<mp[0]<<" "<<mp[1]<<" "<<mp[2]<<"\n";
        if(mp[0]==0)
        {
            if (mp[1] >= 1 && mp[2] == 0 && mp[0] == 0) {
                cout << 0;
            }
            else if (mp[2] % 2 == 0)
                cout << 0;
            else {
                // long double x= pow(2,towes/2);//   cout<<(ll)x;
                megz(mp[2] / 2);
            }
        }
        else if(mp[0]>=2)
        {
            cout<<0;
        }
        else if(mp[0]==1)
        {
            if(v[0]==0)
            {
                cout<<v[n*m-1];
            }
            else if(v[n*m-1]==0)
            {
                cout<<v[0];
            }
            else
            {
                cout<<min(v[0],v[n*m-1]);
            }
        }
    }
}