#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
	int a, b, c, d, e;
	while (scanf("%d%d%d%d%d", &a, &b, &c, &d, &e) != EOF){
		int v = a*b*c;
		int v1 = (a - 2 * e)*(b - 2 * e)*(c - 2 * e);
		int vab = e*(a - 2 * e)*(b - 2 * e);
		int	vac = e*(a - 2 * e)*(c - 2 * e);
		int	vbc = e*(c - 2 * e)*(b - 2 * e);
		int	vkuangjia = v - v1 - 2 * (vac + vab + vbc);
		int vv;
		if (d < e)
			vv = v - 2 * d*(a - 2 * e)*(b - 2 * e) - 2 * d*(a - 2 * e)*(c - 2 * e) - 2 * d*(c - 2 * e)*(b - 2 * e);
		else if (d == e)
			vv = max(v1, vkuangjia);
		else{
			if (a - 2 * d>0 && b - 2 * d > 0 && c - 2 * d > 0)
				vv = max(vkuangjia, (a - 2 * d)*(b - 2 * d)*(c - 2 * d));
			else
				vv = vkuangjia;
		}
		printf("%d\n", vv);
	}
	return 0;
}