#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int dp[11][101][10001];
int is[11][101][10001];
int A[3],B[3],C[3];
int Db,Dc;
void solve(){
	int st = 0;
	using TUP = tuple<int,int,int>;
	vector<TUP> vtB;
	{
		st = Db;
		for(int i0 = 0;i0*1000<=st;i0++){
			for(int i1 = 0;i1*100+i0*1000 <= st;i1++){
				int i2 = st - i0 * 1000 - i1 * 100;
				//cerr<<i0<<' '<<i1<<' '<<i2<<endl;
				vtB.push_back(TUP(i0,i1,i2));
			}
		}
		sort(vtB.rbegin(),vtB.rend());
	}
	vector<TUP> vtC;
	{
		st = Dc;
		for(int i0 = 0;i0*1000<=st;i0++){
			for(int i1 = 0;i1*100+i0*1000 <= st;i1++){
				int i2 = st - i0 * 1000 - i1 * 100;
				//cerr<<i0<<' '<<i1<<' '<<i2<<endl;
				vtC.push_back(TUP(i0,i1,i2));
			}
		}
		sort(vtC.rbegin(),vtC.rend());
	}
	st = A[0] * 1000+ A[1] * 100 + A[2];
	is[A[0]][A[1]][A[2]]=1;
	
	for(int i = st;i>=0;i--){
		for(int i0 = 0;i0*1000<=i;i0++){
			for(int i1 = 0;i1*100+i0*1000<=i;i1++){
				int i2 = i - i0 * 1000 - i1 * 100;
				if(is[i0][i1][i2]==0)continue;
				for(auto &[j0,j1,j2]:vtB){
					if(j0<=i0&&j1<=i1&&j2<=i2){
						int &a = dp[i0-j0+B[0]][i1-j1+B[1]][i2-j2+B[2]];
						a = max(a,dp[i0][i1][i2]+1);
						is[i0-j0+B[0]][i1-j1+B[1]][i2-j2+B[2]] = 1;
					}
				}
				for(auto &[j0,j1,j2]:vtC){
					if(j0<=i0&&j1<=i1&&j2<=i2){
						int &a = dp[i0-j0+C[0]][i1-j1+C[1]][i2-j2+C[2]];
						a = max(a,dp[i0][i1][i2]+1);
						is[i0-j0+C[0]][i1-j1+C[1]][i2-j2+C[2]] = 1;
					}
				}
			}
		}
	}
	int ans = 0;
	for(int i = 0;i<11;i++){
		for(int j = 0;j<101;j++){
			for(int k = 0;k<10001;k++){
				ans = max(ans,dp[i][j][k]);
			}
		}
	}
	cout<<ans<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	for(int i = 0;i<3;i++)cin >> A[i];
	cin >> Db;
	for(int i = 0;i<3;i++)cin >> B[i];
	cin >> Dc;
	for(int i = 0;i<3;i++)cin >> C[i];
	solve();
}