#include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(i=0;i<N;i++)
#define ll long long

typedef struct _quest{
    ll num;
    ll t;
}quest;

bool comp_num(quest a,quest b){
    return a.num<b.num;
}

bool comp_t(quest a,quest b){
    return a.t<b.t;
}

int main(void){
    ll N;
    quest Q[4];
    ll T;

    ll i,j,k;

    rep(i,4)cin>>Q[i].num;
    rep(i,4)cin>>Q[i].t;
    cin>>T;

    sort(Q,Q+4,comp_t);

    ll ans=0;
    rep(i,4){
        ll sol=min(T/Q[i].t,Q[i].num);
        T-=sol*Q[i].t;
        ans+=sol;
    }

    cout<<ans<<endl;

    return 0;
}