#include <bits/stdc++.h>
using namespace std;

int B, b1000, b100, b1;
int C, c1000, c100, c1;

int dp[11][111][11111];
int solve(int a1000, int a100, int a1){
	int& res = dp[a1000][a100][a1];
	if(res != -1)
		return res;

	res = 0;
	{
		int rem = B;
		int k1000 = min(rem / 1000, a1000); rem -= k1000 * 1000;
		int k100  = min(rem / 100,  a100);  rem -= k100 * 100;
		int k1    = min(rem,        a1);    rem -= k1;

		if(rem == 0)
			res = max(res, solve(a1000 - k1000 + b1000, a100 - k100 + b100, a1 - k1 + b1) + 1);
	}
	{
		int rem = C;
		int k1000 = min(rem / 1000, a1000); rem -= k1000 * 1000;
		int k100  = min(rem / 100,  a100);  rem -= k100 * 100;
		int k1    = min(rem,        a1);    rem -= k1;

		if(rem == 0)
			res = max(res, solve(a1000 - k1000 + c1000, a100 - k100 + c100, a1 - k1 + c1) + 1);
	}

	return res;
}


int main(){
	memset(dp, -1, sizeof(dp));

	int a1000, a100, a1;
	cin >> a1000 >> a100 >> a1;
	cin >> B >> b1000 >> b100 >> b1;
	cin >> C >> c1000 >> c100 >> c1;

	cout << solve(a1000, a100, a1) << endl;
	return 0;
}