codeforce 333B chips

Gerald plays the following game. He has a checkered field of size n × n cells, where m various cells are banned. Before the game, he has to put a few chips on some border (but not corner) board cells. Then for n - 1 minutes, Gerald every minute moves each chip into an adjacent cell. He moves each chip from its original edge to the opposite edge. Gerald loses in this game in each of the three cases:

• At least one of the chips at least once fell to the banned cell.
• At least once two chips were on the same cell.
• At least once two chips swapped in a minute (for example, if you stand two chips on two opposite border cells of a row with even length, this situation happens in the middle of the row).

In that case he loses and earns 0 points. When nothing like that happened, he wins and earns the number of points equal to the number of chips he managed to put on the board. Help Gerald earn the most points.

Input

The first line contains two space-separated integers n and m (2 ≤ n ≤ 1000, 0 ≤ m ≤ 10⁵) — the size of the field and the number of banned cells. Next m lines each contain two space-separated integers. Specifically, the i-th of these lines contains numbers x_i and y_i (1 ≤ x_i, y_i ≤ n) — the coordinates of the i-th banned cell. All given cells are distinct.

Consider the field rows numbered from top to bottom from 1 to n, and the columns — from left to right from 1 to n.

Output

Print a single integer — the maximum points Gerald can earn in this game.

Example

Input

3 1
2 2

Output

0

Input

3 0

Output

1

Input

4 3
3 1
3 2
3 3

Output

1

Note

In the first test the answer equals zero as we can't put chips into the corner cells.

In the second sample we can place one chip into either cell (1, 2), or cell (3, 2), or cell (2, 1), or cell (2, 3). We cannot place two chips.

In the third sample we can only place one chip into either cell (2, 1), or cell (2, 4).

题意：有一个n*n的棋盘，在它最外面的四条边放棋子，四个角不能放，然后会规定一些点被ban掉，每个棋子要在接下来n-1步中到达对边，且在棋子移动中下列三种情况不被允许：

1.有至少一个棋子进入被ban的点；

2.两个棋子在同一个点；

3.两个棋子交换；

问最多能放几个棋子；

思路：如果一行或者一列没有被ban的点的话，那么这一行或者这一列可以放一个棋子，否则不能放，还有就是要考虑一下如果棋盘是奇数边的话，那么中心点最多只能放一个棋子，否则会犯第二种情况；

下面是我的代码：

#include<bits/stdc++.h>
using namespace std;
int R[1005],C[1005];//代表行和列 
int main()
{
	int n,m,x,y;
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		scanf("%d %d",&x,&y);
		R[x]=1;
		C[y]=1;
	}
	int ans=0;
	for(int i=2;i<n;i++)
	{
		if(R[i]+C[i]==1)
			ans++;
		else if(R[i]+C[i]==0)
		{
			if(n%2==1&&i==(n+1)/2)//奇数的中心点只能放一个; 
				ans++;
			else
				ans+=2;
		}
	}
	printf("%d\n",ans);
	return 0;
}