#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
#define ll long long

const int maxn = 1e5 + 10;
const int INF = 0x3f3f3f3f;

int main()
{
    int a,b,c,d,e;
    while(~scanf("%d %d %d %d %d",&a,&b,&c,&d,&e)) {
        int sum = a * b * c;
        if (d < e) {
            sum -= 2 * ((a - 2 * e) * (c - 2 * e) * d + (a - 2 * e) * (b - 2 * e) * d + (b - 2 * e) * (c - 2 * e) * d);
            cout << sum << endl;
        } else {
            int tot1 = ((a - 2 * e) * e * e * 4 + (b - 2 * e) * e * e * 4 + (c - 2 * e) * e * e * 4 + e * e * e * 8);
            int tot2 = (a - 2 * d) * (b - 2 * d) * (c - 2 * d);
            cout << max(tot1,tot2) << endl;
        }
    }
}