package no158;

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static int a1000;
	static int a100;
	static int a1;
	static int b1000;
	static int b100;
	static int b1;
	static int db;
	static int c1000;
	static int c100;
	static int c1;
	static int dc;
	static int[][][] dp = new int[11][101][10001];
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		a1000 = sc.nextInt();
		a100 = sc.nextInt();
		a1 = sc.nextInt();
		db = sc.nextInt();
		b1000 = sc.nextInt();
		b100 = sc.nextInt();
		b1 = sc.nextInt();
		dc = sc.nextInt();
		c1000 = sc.nextInt();
		c100 = sc.nextInt();
		c1 = sc.nextInt();
		for(int i=0;i<=10;i++) {
			for(int j=0;j<=100;j++) {
				Arrays.fill(dp[i][j], -1);
			}
		}
		System.out.println(dfs(a1000,a100,a1));
	}
	public static int dfs(int a,int b,int c) {
		if (a < 0 || b < 0 || c < 0) {
			return 0; //苦し紛れ
		}
		if (dp[a][b][c] >= 0) {
			return dp[a][b][c];
		}
		int max = 0;
		for(int i=0;i<=a;i++) {
			for(int j=0;j<=b;j++) {
				int bx = db - i * 1000 - j * 100;
				if (bx >= 0 && bx <= c) {
					max = Math.max(max, dfs(a-i+b1000, b-j+b100, c-bx+b1) + 1);
				}
				int cx = dc - i * 1000 - j * 100;
				if (cx >= 0 && cx <= c) {
					max = Math.max(max, dfs(a-i+c1000, b-j+c100, c-cx+c1) + 1);
				}
			}
		}
		return dp[a][b][c] = max;
	}

}