#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const int mod = (int)1e9 + 7;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

const int N = (int)2e5 + 1, M = N * 2;

int dir_x[4] = {1, -1, 1, -1}, dir_y[4] = {1, -1, -1, 1};

void solve(){  
    int n, a, b, c, d;
    cin >> n >> a >> b >> c >> d;

    queue<vector<int>> q;
    int f[n + 1][n + 1][2];
    memset(f, 0, sizeof f);

    q.push({0, 0, 0});
    q.push({0, 0, 1});
    f[0][0][0] = f[0][0][1] = 1;

    while(!q.empty()){
        auto p = q.front();
        q.pop();

        int x = p[0], y = p[1], z = p[2];
        for(int i = 0; i < 4; i++){
            int dx = dir_x[i] * (z ? a : c) + x, dy = dir_y[i] * (z ? b : d) + y;
            if(dx < 0 || dy < 0 || dx >= n || dy >= n || f[dx][dy][1 - z]){
                continue;
            }
            f[dx][dy][1 - z] = 1;
            q.push({dx, dy, 1 - z});
        }

        for(int i = 0; i < 4; i++){
            int dx = dir_x[i] * (z ? b : d) + x, dy = dir_y[i] * (z ? a : c) + y;
            if(dx < 0 || dy < 0 || dx >= n || dy >= n || f[dx][dy][1 - z]){
                continue;
            }
            f[dx][dy][1 - z] = 1;
            q.push({dx, dy, 1 - z});
        }
    }

    int qwq = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            qwq += (f[i][j][0] || f[i][j][1]);
        }
    }
    cout << qwq << endl;
} 

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    // cin >> t;

    while(t--){
        solve();
    }

    return 0;
}