#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);


template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	int w,h; cin >> w >> h;
	V<V<int>> a(h+2,V<int>(w+2,0));
	for(int i = 1; i <= h; ++i) for(int j = 1; j <= w; ++j) cin >> a[i][j];
	
	map<P<int,int>,V<P<int,int>>> mp;
	for(int i = 0; i < h+2; ++i){
		for(int j = 0; j < w+2; ++j){
			if(i%2){
				mp[{i,j}].push_back({i-1,j});
				mp[{i,j}].push_back({i-1,j+1});
				mp[{i,j}].push_back({i,j+1});
				mp[{i,j}].push_back({i+1,j+1});
				mp[{i,j}].push_back({i+1,j});
				mp[{i,j}].push_back({i,j-1});
			}
			else{
				mp[{i,j}].push_back({i-1,j-1});
				mp[{i,j}].push_back({i-1,j});
				mp[{i,j}].push_back({i,j+1});
				mp[{i,j}].push_back({i+1,j});
				mp[{i,j}].push_back({i+1,j-1});
				mp[{i,j}].push_back({i,j-1});
			}
		}
	}
	
	queue<P<int,int>> q;
	a[0][0] = -1;
	q.push({0,0});

	while(q.size()){
		auto p = q.front();
		q.pop();
		for(auto e:mp[p]){
			if(0<=e.first&&e.first<h+2&&0<=e.second&&e.second<w+2&&a[e.first][e.second]==0){
				a[e.first][e.second]=-1;
				q.push(e);
			}
		}
	}
	for(int i = 0; i < h+2; ++i) for(int j = 0; j < w+2; ++j){
		if(a[i][j]==-1) a[i][j] = 0;
		else if (a[i][j]==0) a[i][j] = 1;
	}
	int ans = 0;
	for(int i = 0; i < h+2; ++i) for(int j = 0; j < w+2; ++j){
		if(!a[i][j]) continue;
		for(auto e:mp[{i,j}]) if(!a[e.first][e.second]) ans++;
	}
	cout << ans << endl;

	return 0;
}



Measured memory_bytes: 4840