#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
map<pair<int,int>,int>eage; 
long long n,m,x,y,xx,yy;
int dx[10]={0,2,1,-1,-2,-2,-1, 1, 2};
int dy[10]={0,1,2, 2, 1,-1,-2,-2,-1};
int main(){
cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>x>>y;
		eage[make_pair(x,y)]=1;
			for(int j=1;j<=8;j++){
				xx=x+dx[j];
				yy=y+dy[j];
					if(xx>0&&yy>0&&xx<=n&&yy<=n){
						eage[make_pair(xx,yy)]=1; 					
					}				
			} 

	}
	cout<<n*n-eage.size();
return 0;
}