#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int A[3], D[2], B[2][3];
	rep(k, 3) cin >> A[k];
	rep(i, 2) {
		cin >> D[i];
		rep(k, 3) cin >> B[i][k];
	}
	vector<vector<vector<int> > > dp(11, vector<vector<int> >(101, vector<int>(10001, -1)));
	dp[A[0]][A[1]][A[2]] = 0;
	int ans = 0;
	for(int t = 10000; t >= 0; -- t) {
		int m0 = t / 1000;
		rer(a0, 0, m0) {
			int m1 = (t - a0 * 1000) / 100;
			rer(a1, 0, m1) {
				int a2 = t - a0 * 1000 - a1 * 100;
				int x = dp[a0][a1][a2];
				if(x == -1) continue;
//				cerr << t << ", " << a0 << ", " << a1 << ", " << a2 << ": " << x << endl;
				amax(ans, x);
				rep(i, 2) {
					int a0t = a0, a1t = a1, a2t = a2;
					int d = D[i];
					{	int t = min(a0t, d / 1000);
						d -= t * 1000, a0t -= t;
					}
					{	int t = min(a1t, d / 100);
						d -= t * 100, a1t -= t;
					}
					{	int t = min(a2t, d / 1);
						d -= t * 1, a2t -= t;
					}
					if(d == 0) {
						a0t += B[i][0];
						a1t += B[i][1];
						a2t += B[i][2];
						amax(dp[a0t][a1t][a2t], x + 1);
					}
				}
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}