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

void solve() {
  ll n = 4;
  vector<pair<ll, ll>> pa(n);
  {
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    vector<ll> p(n);
    rep(i, n) cin >> p[i];
    rep(i, n) pa[i] = {p[i], a[i]};
  }
  sort(pa.rbegin(), pa.rend());
  ll t, ans = 0;
  cin >> t;
  rep(i, n) {
    auto [p, a] = pa.back();
    pa.pop_back();
    ll now = min(t / p, a);
    ans += now;
    t -= now * p;
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}