Codefroces 675 B. Restoring Painting

B. Restoring Painting

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was stolen while he was on duty. He doesn't want to be fired, so he has to quickly restore the painting. He remembers some facts about it.

• The painting is a square 3 × 3, each cell contains a single integer from 1 to n, and different cells may contain either different or equal integers.
• The sum of integers in each of four squares 2 × 2 is equal to the sum of integers in the top left square 2 × 2.
• Four elements a, b, c and d are known and are located as shown on the picture below.

Help Vasya find out the number of distinct squares the satisfy all the conditions above. Note, that this number may be equal to 0, meaning Vasya remembers something wrong.

Two squares are considered to be different, if there exists a cell that contains two different integers in different squares.

Input

The first line of the input contains five integers n, a, b, c and d (1 ≤ n ≤ 100 000,1 ≤ a, b, c, d ≤ n) — maximum possible value of an integer in the cell and four integers that Vasya remembers.

Output

Print one integer — the number of distinct valid squares.

Examples

input

2 1 1 1 2

output

2

input

3 3 1 2 3

output

6

Note

Below are all the possible paintings for the first sample.

In the second sample, only paintings displayed below satisfy all the rules.

    题目理解，该题要求求出符合题目要求的填数种数。要求填入的数均在一至n之间，且任意2*2四方格中的数字和加起来相等。题目很简单，但此题的思路值得记住，可以先根据要求化简出四个方程，由于有四个未知变量，求出的解都可根据已知的四个变量和一个未知变量表示，所以只需要根据未知变量的枚举求出其他未知变量判断是否满足给定的在1-n之间的要求即可，若满足则res++。而中间元素是任意元素都可以，所以求出后还得乘以n。

#include <stdio.h>
using namespace std;
int main()
{
	long long  a, b, c, d, n, e, f, i, h;
	while(scanf("%I64d %I64d %I64d %I64d %I64d",&n,&a,&b,&c,&d))
	{
		long long num = 0;
		for(long long e=1; e<=n; e++)//确定一个值求出其它值是否满足 
		{
			f = b+e-c;
			h = a+e-d;
			i = b-c+h;
			if( (h>=1&&h<=n) && (f>=1&&f<=n) && (i>=1&&i<=n) )
				num++;
		}
		printf("%I64d\n",num*n);
	}
	return 0;
}

     题目很水，做完有一种感触，把握不好数学运算和计算机运算之间的度，感觉解决方法只有多多刷题，有了一定的题目积累后自然会水到渠成的吧。保持淡定。

    特记下，以备后日回顾。