//cojs.tk 41 1265 382 477 1660 ★
//http://www.cr173.com/html/15301_all.html
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <cstdlib>
#include <climits>
#include <algorithm>
using namespace std;

const int maxn=1000+10;
int a1,a2,a3,a4,a5,a6;
int ans,max1;
bool f[maxn];

int main()
{
	freopen("fmcz.in","r",stdin);
	freopen("fmcz.out","w",stdout);
	
	scanf("%d%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5,&a6);
	max1=a1+a2*2+a3*3+a4*5+a5*10+a6*20;
	for(int i1=0;i1<=a1;i1++)
	for(int i2=0;i2<=a2;i2++)
	for(int i3=0;i3<=a3;i3++)
	for(int i4=0;i4<=a4;i4++)
	for(int i5=0;i5<=a5;i5++)
	for(int i6=0;i6<=a6;i6++)
	{
		if(i1+i2+i3+i4+i5+i6!=0)
		{
			int t;
			t=i1+i2*2+i3*3+i4*5+i5*10+i6*20;
			f[t]=true;
		}
	}
	for(int i=1;i<=max1;i++)
	{
		if(f[i])
		{
			ans++;
		}
	} 
	printf("%d\n",ans);
	
	return 0;
}