#include <bits/stdc++.h>
#include <atcoder/segtree.hpp>
#include <atcoder/lazysegtree.hpp>
#include <atcoder/modint.hpp>
using namespace std;

using i32 = int;
using i64 = long long;
using i128 = __int128_t;
using f64 = double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
  _main();
}

void _main() {
  i64 h, w;
  cin >> h >> w;
  vector<vector<i64>> a(h, vector<i64>(w));
  vector<i64> v1(h, 0), v2(w, 0);
  for (i64 i = 0; i < h; i++) {
    for (i64 j = 0; j < w; j++) {
      cin >> a[i][j];
      v1[i] ^= a[i][j];
      v2[j] ^= a[i][j];
    }
  }
  i64 sum1 = 0, sum2 = 0;
  for (i64 i = 0; i < h; i++) sum1 += v1[i];
  for (i64 i = 0; i < w; i++) sum2 += v2[i];
  cout << max(sum1, sum2) << "\n";
}