#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define LB(v, x) (int)(lower_bound(ALL(v), x) - (v).begin())
#define UQ(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define IO ios::sync_with_stdio(false), cin.tie(nullptr);
#define chmax(a, b) (a) = (a) < (b) ? (b) : (a)
#define chmin(a, b) (a) = (a) < (b) ? (a) : (b)
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N = 4;
    vector<pair<ll, ll>> A(N);
    for (int i = 0; i < N; i++) cin >> A[i].second;
    for (int i = 0; i < N; i++) cin >> A[i].first;
    sort(ALL(A));
    ll T;
    cin >> T;

    ll ans = 0, now = 0;
    for (auto [time, cnt] : A) {
        if (now + time * cnt <= T) {
            now += time * cnt;
            ans += cnt;
        } else {
            ans += (T - now) / time;
            break;
        }
    }

    cout << ans << endl;
}