void deal(int x,int y)
{
	y-=min(a[2],x)*4;
	a[2]-=min(a[2],x);
	a[1]-=min(a[1],y);
}

int solve()
{
	int ans=0,tmp,x,y;
	ans+=a[6];
	ans+=a[5],a[1]-=min(a[1],a[5]*11);
	ans+=a[4];
	deal(a[4]*5,a[4]*20);
	ans+=(3+a[3])/4;
	tmp=a[3]%4;
	switch(tmp){
	case 0:x=0,y=0;break;
	case 1:x=5,y=27;break;
	case 2:x=3,y=18;break;
	case 3:x=1,y=9;break;
	}
	deal(x,y);
	ans+=(8+a[2])/9;
	if(a[2]%9!=0)y=(9-(a[2]%9))*4;
	else y=0;
	deal(0,y);
	ans+=(a[1]+35)/36;
	return ans;
}