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

short dp[11][101][10001];
int db;
int dc;
int b1000, b100, b1;
int c1000, c100, c1;

int f(int a, int b, int c) {
	if (dp[a][b][c] != -1) {
		return dp[a][b][c];
	}
	int ret = 0;
	for (int i = db % 100; i <= min(c, db); i += 100) {
		for (int j = 0; i + j * 100 <= db && j <= b; j++) {
			if ((db - i - j * 100) % 1000 != 0) {
				continue;
			}
			int k = (db - i - j * 100) / 1000;
			if (k > a) {
				continue;
			}
			ret = max(ret, 1 + f(a - k + b1000, b - j + b100, c - i + b1));
		}
	}
	for (int i = dc % 100; i <= min(c, dc); i += 100) {
		for (int j = 0; i + j * 100 <= dc && j <= b; j++) {
			if ((dc - i - j * 100) % 1000 != 0) {
				continue;
			}
			int k = (dc - i - j * 100) / 1000;
			if (k > a) {
				continue;
			}
			ret = max(ret, 1 + f(a - k + c1000, b - j + c100, c - i + c1));
		}
	}
	return dp[a][b][c] = ret;
}

int main() {
	int a1000, a100, a1;
	cin >> a1000 >> a100 >> a1;
	cin >> db;
	cin >> b1000 >> b100 >> b1;
	cin >> dc;
	cin >> c1000 >> c100 >> c1;
	memset(dp, -1, sizeof(dp));
	cout << f(a1000, a100, a1) << endl;
}