package SouHu;
import java.util.Scanner;
public class SoHuWrapProduct {
public int solve(int[] arr){
int count=0;
count+=arr[5];
count+=arr[4];
int one=11*arr[4];
count+=arr[3];
int two=5*arr[3];
//轉化3
count+=arr[2]/4;
if(arr[2]%4!=0) count++;
if(arr[2]%4==1){
two+=5;
one+=7;
}
if(arr[2]%4==2){
two+=3;
one+=6;
}
if(arr[2]%4==3){
two+=1;
one+=5;
}
if(arr[1]<=two){
one=one+(two-arr[1])*4;
}else{
count+=(arr[1]-two)/9;
if((arr[1]-two)%9!=0){
count++;
one+=(((arr[1]-two)%9)*4);
}
}
if(arr[0]<=one){
return count;
}else{
count+=(arr[0]-one)/36;
if((arr[0]-one)%36!=0) count++;
return count;
}
}
public static void main(String[] args){
SoHuWrapProduct s=new SoHuWrapProduct();
Scanner in=new Scanner(System.in);
int[] arr=new int[6];
while(in.hasNext()){
for(int i=0;i<6;i++) arr[i]=in.nextInt();
System.out.println(s.solve(arr));
}
}
}