#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int A[3],B[3],C[3];
int DB,DC;

int ma;
vector<pair<pair<int,int>,int> > V[10001];
map<pair<pair<int,int>,int>,int> M;


pair<pair<int,int>,int> h(int a,int b,int c) {
	return make_pair(make_pair(a,b),c);
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>A[0]>>A[1]>>A[2];
	cin>>DB;
	cin>>B[0]>>B[1]>>B[2];
	cin>>DC;
	cin>>C[0]>>C[1]>>C[2];
	
	queue<pair<pair<int,int>,int> > q;
	q.push(h(A[0],A[1],A[2]));
	M[h(A[0],A[1],A[2])]=0;
	V[A[0]*1000+A[1]*100+A[2]].push_back(h(A[0],A[1],A[2]));
	for(i=10000;i>=0;i--) {
		sort(V[i].begin(),V[i].end());
		
		FOR(y,V[i].size()) {
			if(y>0 && V[i][y]==V[i][y-1]) continue;
			ma=max(ma,M[V[i][y]]);
			{
				pair<pair<int,int>,int> k=V[i][y],k2;
				int x=DB;
				j=min(x/1000,k.first.first);
				k.first.first -= j; x -= j*1000;
				j=min(x/100,k.first.second);
				k.first.second -= j; x -= j*100;
				j=min(x,k.second);
				k.second -= j; x -= j;
				if(x==0) {
					k2=h(k.first.first+B[0],k.first.second+B[1],k.second+B[2]);
					r=(k.first.first+B[0])*1000+(k.first.second+B[1])*100+k.second+B[2];
					M[k2]=M[V[i][y]]+1;
					V[r].push_back(k2);
				}
			}
			{
				pair<pair<int,int>,int> k=V[i][y],k2;
				int x=DC;
				j=min(x/1000,k.first.first);
				k.first.first -= j; x -= j*1000;
				j=min(x/100,k.first.second);
				k.first.second -= j; x -= j*100;
				j=min(x,k.second);
				k.second -= j; x -= j;
				if(x==0) {
					k2=h(k.first.first+C[0],k.first.second+C[1],k.second+C[2]);
					r=(k.first.first+C[0])*1000+(k.first.second+C[1])*100+k.second+C[2];
					M[k2]=M[V[i][y]]+1;
					V[r].push_back(k2);
				}
			}
		}
		
	}
	
	
	
	
	cout<<ma<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}