#include <bits/stdc++.h>
using namespace std;
typedef tuple<int, int, int> tii;

inline int rd() {
	int x = 0; bool f = 0; char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define N 507

bool vis[N][N][2]; // 0 (a,b) 1 (c,d)

queue<tii> q;

int main() {
	int n = rd();
	int a = rd(), b = rd(), c = rd(), d = rd();
	int dx[2][8] = {{a, a, -a, -a, b, b, -b, -b}, {c, c, -c, -c, d, d, -d, -d}};
	int dy[2][8] = {{b, -b, b, -b, a, -a, a, -a}, {d, -d, d, -d, c, -c, c, -c}};
	vis[0][0][0] = 1; q.push({0, 0, 0});
	vis[0][0][1] = 1; q.push({0, 0, 1});
	while (!q.empty()) {
		auto [x, y, op] = q.front(); q.pop();
		for (int i = 0; i < 8; ++i) {
			int tx = x + dx[op][i];
			int ty = y + dy[op][i];
			if (tx < 0 || tx >= n || ty < 0 || ty >= n) continue;
			if (vis[tx][ty][op ^ 1]) continue;
			vis[tx][ty][op ^ 1] = true;
			q.push({tx, ty, op ^ 1});
		}
	}
	int ans = 0;
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j)
			if (vis[i][j][0] || vis[i][j][1]) ++ans;
	printf("%d\n", ans);
	return 0;
}