cf 675 B

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

//给你n a b c d 5个数问你有多少种情况可以符合任意的2*2的方块的和相等 第一个数从1-n枚举（不考虑中间）后面三个数通过加减可以得到并判断是否在1-n中  如果三个数都可以得到则有n种情况

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,a,b,c,d;
scanf("%lld%lld%lld%lld%lld",&n,&a,&b,&c,&d);
ll s1,t,res=0;
s1=t=0;
for(ll i=1;i<=n;i++)
{
s1=i+a+b;
t=s1-a-c;
if(t<1||t>n)
continue;
t=s1-b-d;
if(t<1||t>n)
continue;
t=s1-c-d;
if(t<1||t>n)
continue;
res+=n;
}
printf("%lld\n",res);
return 0;
}