#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <vector>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
using namespace std;

const int maxn=10000+10;
int a[7],x;
long long ans1,ans;
bool f[maxn];

int main()
{
	freopen("fmcz.in","r",stdin);
	freopen("fmcz.out","w",stdout);
	
	for (int i=1; i<=6; i++)
		cin>>a[i];
	for (int i1=0; i1<=a[1]; i1++)
	for (int i2=0; i2<=a[2]; i2++)
	for (int i3=0; i3<=a[3]; i3++)
	for (int i4=0; i4<=a[4]; i4++)
	for (int i5=0; i5<=a[5]; i5++)
	for (int i6=0; i6<=a[6]; i6++)
	{
		if(i1*1+i2*2+i3*3+i4*5+i5*10+i6*20!=0 
		&& !f[i1*1+i2*2+i3*3+i4*5+i5*10+i6*20])
		{
			ans++;
			f[i1*1+i2*2+i3*3+i4*5+i5*10+i6*20]=true;
		}
	}
	cout<<ans<<endl;
	return 0;
}