#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}




int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        
        int n = 4;
        vector<pair<pair<ll, ll>,double>>p(n);
        p[0].second = 1; p[1].second = 1.5;
        p[2].second = 2; p[3].second = 2.5;
        for (int i = 0; i < n; i++)cin >> p[i].first.first; //cout << "#";
        for (int i = 0; i < n; i++)cin >> p[i].first.second;
        ll T;
        cin >> T;
        ll ans = 0;
        do {
            
            ll t = T;
            ll x = 0;
            for (int i = 0; i < n; i++) {
                
                ll y = min(p[i].first.first, t / p[i].first.second);
                x += y;
                t -= y*p[i].first.second;
                //cout << t;
            }
            ans = max(ans, x);
            //cout << ans;
        } while (next_permutation(p.begin(), p.end()));
        cout << ans;
    
    }
        return 0;
}