codeforces 675B Restoring Painting

思路：列一下方程就可以知道只要固定一个数，那么剩下的三个数都是固定的，那么求出来之后check一下是否在1到n范围内即可

#include<iostream>
#include<cstdio>

using namespace std;
#define LL long long
int n;
bool check(int a,int b,int c)
{
if (a>=1 && a<=n && b>=1&&b<=n&&c>=1 &&c<=n)
return true;
return false;
}
int main()
{
int a,b,c,d;
scanf("%d%d%d%d%d",&n,&a,&b,&c,&d);
LL ans = 0;
for (int i = 1;i<=n;i++)
{
int a2 = i+a+b-a-c;
int a4 = i-d+a;
int a5 = i+a+b-c-d;
if (check(a2,a4,a5))
ans++;
}
printf("%lld\n",ans*n);
}

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.