#include <stdio.h>
#include <math.h>

int a1000;
int a100;
int a1;
int b1000;
int b100;
int b1;
int db;
int c1000;
int c100;
int c1;
int dc;
int dp[11][101][10001];
int max(int a,int b) {
	return a > b ? a : b;
}
int dfs(int a,int b,int c) {
	int i,j;
		if (a < 0 || b < 0 || c < 0) {
			return 0; //苦し紛れ
		}
		if (dp[a][b][c] >= 0) {
			return dp[a][b][c];
		}
		int ret = 0;
		for(i=0;i<=a;i++) {
			for(j=0;j<=b;j++) {
				int bx = db - i * 1000 - j * 100;
				if (bx >= 0 && bx <= c) {
					ret = max(ret, dfs(a-i+b1000, b-j+b100, c-bx+b1) + 1);
				}
				int cx = dc - i * 1000 - j * 100;
				if (cx >= 0 && cx <= c) {
					ret = max(ret, dfs(a-i+c1000, b-j+c100, c-cx+c1) + 1);
				}
			}
		}
		return dp[a][b][c] = ret;
	}
int main() {
	scanf("%d",&a1000);
	scanf("%d",&a100);
	scanf("%d",&a1);
	scanf("%d",&db);
	scanf("%d",&b1000);
	scanf("%d",&b100);
	scanf("%d",&b1);
	scanf("%d",&dc);
	scanf("%d",&c1000);
	scanf("%d",&c100);
	scanf("%d",&c1);
	int i,j,k;
	for(i=0;i<=10;i++) {
		for(j=0;j<=100;j++) {
			for(k=0;k<=10000;k++) {
				dp[i][j][k] = -1;
			}
		}
	}
	printf("%d\n",dfs(a1000,a100,a1));
	return 0;

}