#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstdio>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)

int ans = 0;
int DB, b[3];
int DC, c[3];
const int INF = 1e8;

void dfs(int a[], int cnt){
	// printf("%d %d %d %d\n", a[0], a[1], a[2], cnt);
	int tmp[3];
	int nokori;
	//bさん
	rep(i, 3) tmp[i] = a[i];
	nokori = DB;
	if(nokori >= 1000 && tmp[0] > 0){
		int mi = min(nokori / 1000, tmp[0]);
		int tukau = mi;
		nokori -= 1000 * mi;
		tmp[0] -= tukau;
	}
	if(nokori >= 100 && tmp[1] > 0){
		int mi = min(nokori / 100, tmp[1]);
		int tukau = mi;
		nokori -= 100 * mi;
		tmp[1] -= tukau;
	}
	if(nokori <= tmp[2]){//砦
		tmp[2] -= nokori;
		rep(i, 3) tmp[i] += b[i];
		// printf("dfs %d %d %d\n", tmp[0], tmp[1], tmp[2]);
		dfs(tmp, cnt + 1);
	}else{
		ans = max(ans, cnt);
	}

	//cさん
	// printf("csann %d %d %d\n", tmp[0], tmp[1], tmp[2]);
	rep(i, 3) tmp[i] = a[i];
	// printf("csann %d %d %d\n", tmp[0], tmp[1], tmp[2]);

	nokori = DC;
	if(nokori >= 1000 && tmp[0] > 0){
		int mi = min(nokori / 1000, tmp[0]);
		int tukau = mi;
		nokori -= 1000 * mi;
		tmp[0] -= tukau;
	}
	if(nokori >= 100 && tmp[1] > 0){
		int mi = min(nokori / 100, tmp[1]);
		int tukau = mi;
		nokori -= 100 * mi;
		tmp[1] -= tukau;
	}
	if(nokori <= tmp[2]){//砦
		tmp[2] -= nokori;
		rep(i, 3) tmp[i] += c[i];
		// printf("dfs %d %d %d\n", tmp[0], tmp[1], tmp[2]);
		dfs(tmp, cnt + 1);
	}else{
		ans = max(ans, cnt);
	}

	return;
}

int main(void){
	int a[3];
	rep(i, 3) cin >> a[i];
	cin >> DB;
	rep(i, 3) cin >> b[i];
	cin >> DC;
	rep(i, 3) cin >> c[i];
	dfs(a, 0);
	printf("%d\n", ans);
	return 0;
}