#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
ll base=100000;
vl calc(ll hash,ll x){
    vl ret;
    vl z(3);z[2]=hash%base;hash/=base;z[1]=hash%base;hash/=base;z[0]=hash;
    if(x%100>z[2]||z[0]*1000+z[1]*100+z[2]<x)return ret;
    z[2]-=x%100;x-=x%100;
    for(int i=0;i<=z[0];i++){
        for(int j=0;j<=z[1];j++){
            ll k=x-i*1000-j*100;
            if(k<0)break;
            if(k<=z[2]){
                ll p=z[0]-i;p*=base;p+=z[1]-j;p*=base;p+=z[2]-k;
                ret.pb(p);
            }
        }
    }
    return ret;
}
int main(){
    vl v(3);rep(i,3)cin >> v[i];
    ll b;cin >> b;
    vl x(3);rep(i,3)cin >> x[i];
    ll c;cin >> c;
    vl y(3);rep(i,3)cin >> y[i];
    queue<ll> que;
    unordered_map<ll,vl> mp;
    unordered_map<ll,bool> seen;
    ll s=v[0];s*=base;s+=v[1];s*=base;s+=v[2];
    ll xx=x[0];xx*=base;xx+=x[1];xx*=base;xx+=x[2];
    ll yy=y[0];yy*=base;yy+=y[1];yy*=base;yy+=y[2];
    vl px;
    que.push(s);
    while(!que.empty()){
        ll z=que.front();que.pop();
        px.push_back(z);
        for(auto &p:calc(z,b)){
            p+=xx;
            mp[z].pb(p);
            if(seen[p])continue;
            que.push(p);seen[p]=true;
        }
        for(auto &p:calc(z,c)){
            p+=yy;
            mp[z].pb(p);
            if(seen[p])continue;
            que.push(p);seen[p]=true;
        }
    }
    /*for(auto p:mp){
        cout << p.fi <<" ";
        for(auto z:p.se)cout << z <<" ";cout << endl;
    }*/
    unordered_map<ll,ll> dist;
    dist[px[0]]=0;
    for(auto p:px){
        for(auto zz:mp[p]){
            chmax(dist[zz],dist[p]+1);
        }
    }
    ll ans=0;
    for(auto p:dist)chmax(ans,p.se);
    cout << ans <<endl;
}