#include <iostream>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <unordered_map>
using namespace std;
using ll = long long;
int main() {
	int H, W;cin >> H >> W;
	int res1 = 0;
	int res2 = 0;
	vector<vector<int>> A(H, vector<int>(W, 0));
	for (int i = 0;i < H;i++) {
		int sm = 0;
		for (int j = 0;j < W;j++) {
			cin >> A[i][j];
			sm = (sm + A[i][j]) % 2;
		}
		res1 += sm;
	}
	for (int i = 0;i < W;i++) {
		int sm = 0;
		for (int j = 0;j < H;j++) sm = (sm + A[j][i]) % 2;
		res2 += sm;
	}
	cout << max(res1, res2 )<< endl;
}